8822
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14472
- Proper Divisor Sum (Aliquot Sum)
- 5650
- 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
- 4000
- Möbius Function
- -1
- Radical
- 8822
- 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
- yes
- Odd
- no
Appears in sequences
- If a, b in sequence, so is ab+10.at n=38A009368
- Coordination sequence for CaF2(2), F position.at n=42A009925
- a(0) = 1, a(n) = 5*n^2 + 2 for n>0.at n=42A010001
- a(0) = 1, a(n) = 20*n^2 + 2 for n>0.at n=21A010010
- Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n faces and k vertices, where (n/2+2) <= k <= (2n+8).at n=32A058787
- Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n faces and k vertices, where (n/2+2) <= k <= (2n+8).at n=50A058787
- Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n edges and k vertices (or k faces), where (n/3+2) <= k <= (2n/3). Note that there is no such k when n=7.at n=36A058788
- Triangle T(n,k) = number of polyhedra (triconnected planar graphs) with n edges and k vertices (or k faces), where (n/3+2) <= k <= (2n/3). Note that there is no such k when n=7.at n=38A058788
- Expansion of series related to Liouville's Last Theorem: g.f. Sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^3 *Product_{i=1..t} (1-x^i) ).at n=42A059820
- Geometric mean of the digits = 4. In other words, the product of the digits is = 4^k where k is the number of digits.at n=43A061428
- Write 0, 1, 2, 3, 4, ... in a triangular spiral, then a(n) is the sequence found by reading the terms along the line from 0 in the direction 0, 7, ...at n=44A062725
- Numbers, not composed of the same digits, such that the geometric and arithmetic means of their decimal digits are integers.at n=37A067452
- a(n) = n * prime(prime(n)).at n=21A080697
- a(n) = n*(20 + 15*n + n^2)/6.at n=32A101853
- Row sums of triangle A117427.at n=7A117428
- Numbers k such that 2^k modulo Fibonacci(k) is prime, i.e., A057862(k) is prime.at n=18A128161
- Numbers k such that k and k^2 use only the digits 2, 4, 6, 7 and 8.at n=22A137101
- Irregular triangle read by rows: T(n,k) is the number of polyhedra with n faces and k vertices (n >= 4, k=4..2n-4).at n=44A212438
- Number of (w,x,y,z) with all terms in {0,...,n} and (least gapsize)=1.at n=12A212894
- Number of (w,x,y,z) with all terms in {0,...,n} and |w-x|+|x-y+|y-z|=2n.at n=44A212905