8812
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 15428
- Proper Divisor Sum (Aliquot Sum)
- 6616
- 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
- 4404
- Möbius Function
- 0
- Radical
- 4406
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 52
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 84.at n=28A020423
- Every suffix prime and no 0 digits in base 9 (written in base 9).at n=44A024784
- "BHK" (reversible, identity, unlabeled) transform of 0,1,1,1...at n=22A032090
- Numbers having four 4's in base 6.at n=25A043388
- Consider all integer triples (i,j,k), j >= k>0, with i^3=binomial(j+2,3)+binomial(k+2,3), ordered by increasing i; sequence gives k values.at n=11A054210
- Number of times A045572(n) is concatenated with itself in A088073.at n=10A088074
- Rectangular table, read by antidiagonals, such that the g.f. of row n, R_n(y), satisfies: R_n(y) = [ Sum_{k>=0} y^k * R_{n*k}(y) ]^n for n>=0, with R_0(y)=1.at n=42A124550
- Row 2 of table A124550; also equals the self-convolution square of A124562, which is row 2 of table A124560.at n=6A124552
- a(n) = Hermite(n,5).at n=4A158513
- The 4th Hermite Polynomial evaluated at n: H_4(n) = 16n^4 - 48n^2 + 12.at n=5A163323
- a(n) = A163914(2n).at n=6A163909
- Number of 3-cycles in range [A000302(n-1)..A024036(n)] of permutation A163355/A163356.at n=12A163914
- 0-sequence of reduction of triangular number sequence by x^2 -> x+1.at n=11A192244
- Number of 2 X 2 matrices having all terms in {-n,...,0,...,n} and determinant n-1.at n=26A211141
- Antidiagonal sums of the convolution array A213783.at n=22A213760
- G.f. satisfies: A(x) = exp( Sum_{n>=1} x^n/n * Product_{k>=1} (1 + x^(n*k)*A(x^k)^n) ).at n=12A218552
- The number of permutations of length n sortable by 2 block transpositions.at n=9A228392
- a(n) = 8*n^2 + 3*n + 1.at n=33A236267
- Number T(n,k) of tilings of a 5 X n rectangle with pentominoes of any shape and exactly k pentominoes of shape I; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=22A247703
- Number of (n+1) X (2+1) 0..1 arrays with no 2 X 2 subblock having x11-x00 less than x10-x01.at n=4A251262