8823
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12528
- Proper Divisor Sum (Aliquot Sum)
- 3705
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5504
- Möbius Function
- -1
- Radical
- 8823
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 47
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of n-node rooted trees of height 3.at n=16A000235
- Number of partitions of n into parts of sizes {a( )} is a(n).at n=52A007209
- Every run of digits of n in base 16 has length 2.at n=36A033014
- Number of partitions of n into parts not of form 4k+2, 16k, 16k+5 or 16k-5.at n=52A036022
- Positive integers having more base-16 runs of even length than odd.at n=38A044842
- Truncated triangular pyramid numbers: a(n) = Sum_{k=4..n} (k*(k+1)/2 - 9).at n=33A051937
- Numbers k such that 5*3^k + 2 is prime.at n=30A058590
- a(n) = (9*n^2 + 5*n + 2)/2.at n=44A064225
- Exp(n) is further from an integer than any previous exp(k) for 1 <= k < n.at n=17A080053
- Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 5 and (n+6) mod 8 <> 1.at n=10A096024
- Numbers n such that (273*2^n-1)^2-2 is prime.at n=42A100913
- Absolute value of coefficient of term [x^(n-8)] in characteristic polynomial of maximum matrix A of size n X n, where n >= 8. Maximum matrix A(i,j) is MAX(i,j), where indices i and j run from 1 to n.at n=3A112464
- a(n) = 20*n^2 + 3.at n=20A167573
- First column of triangle in A176452.at n=16A176485
- Number of -3..3 arrays x(0..n-1) of n elements with zero sum, and adjacent elements not both strictly positive and not both strictly negative.at n=6A199893
- T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum, and adjacent elements not both strictly positive and not both strictly negative.at n=42A199898
- Number of -n..n arrays x(0..6) of 7 elements with zero sum, and adjacent elements not both strictly positive and not both strictly negative.at n=2A199902
- Number of partitions of n with difference -4 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=40A242688
- Number of standard Young tableaux with n cells such that the lengths of the first and the last row differ by 6.at n=4A244300
- Number of standard Young tableaux with 2n cells such that the lengths of the first and the last row differ by n.at n=6A244305