8869
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 31
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 10374
- Proper Divisor Sum (Aliquot Sum)
- 1505
- 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
- 7560
- Möbius Function
- 0
- Radical
- 1267
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 78
- 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
- no
- Odd
- yes
Appears in sequences
- Eight iterations of Reverse and Add are needed to reach a palindrome.at n=29A015988
- Pseudoprimes to base 19.at n=39A020147
- Pseudoprimes to base 48.at n=40A020176
- Numbers with exactly 7 1's in their ternary expansion.at n=30A023698
- a(n) = floor(exp(13/23)*n!).at n=6A030816
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 46 ones.at n=31A031814
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 3).at n=44A035538
- Sums of 7 distinct powers of 3.at n=15A038469
- Recip transform of 2*(1 + x^3 + x^5)-1/(1-x).at n=8A049157
- Triangle T(n,d) = number of distinct d-dimensional polyominoes (or polycubes) with n cells (0 < d < n).at n=33A049429
- Triangle read by rows: T(n,d) is the number of distinct properly d-dimensional polyominoes (or polycubes) with n cells (n >= 1, d >= 0).at n=42A049430
- Numbers n such that n | 7^n + 6^n + 1.at n=17A057298
- a(n) = least odd number which can be represented in the form p + 2*k^2, k>0, in n different ways.at n=45A060004
- Numbers which need eight 'Reverse and Add' steps to reach a palindrome.at n=24A065213
- a(1) = 2, thereafter a(n) = Sum_{k=1..n-1} floor(a(n-k)/k).at n=21A100483
- Number of free hexagonal polygons of symmetry class C_(3h) and area n.at n=23A121212
- Number of ways to place zero or more nonadjacent 1,0 1,1 2,0 3,1 3,2 4,3 5,2 5,3 polyhexes in any orientation on a planar nXnXn triangular grid.at n=7A155412
- Cubes (n * n * n) in carryless arithmetic mod 10.at n=29A169885
- The least nonsquare number s having exactly n twos in the periodic part of the continued fraction of sqrt(s).at n=27A206582
- 1/4 the number of (n+1)X(n+1) 0..3 symmetric matrices with every 2X2 subblock having one, three or four distinct values.at n=2A211108