8902
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13356
- Proper Divisor Sum (Aliquot Sum)
- 4454
- 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
- 4450
- Möbius Function
- 1
- Radical
- 8902
- Omega Function (Ω)
- 2
- 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
- 140
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Number of possible chess games at the end of the n-th ply plus number of games that terminate (i.e., mate) in fewer than n plies.at n=3A006494
- Number of chess games with n plies (another version).at n=3A007545
- Number of chess games with n plies (another version).at n=3A007577
- a(n) = floor(C(2n,n)/2^(n+1)).at n=17A024504
- a(n) = T(n,n+2), T given by A027052.at n=13A027053
- Expansion of 1/((1-4x)(1-7x)(1-9x)(1-10x)).at n=3A028149
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 94.at n=5A031592
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 50 ones.at n=31A031818
- Becomes prime after exactly 7 iterations of f(x) = sum of prime factors of x.at n=11A047826
- Becomes prime or 4 after exactly 8 iterations of f(x) = sum of prime factors of x.at n=33A048130
- Number of possible chess games at the end of the n-th ply.at n=3A048987
- Consider the version of the Collatz or 3x+1 problem where x -> x/2 if x is even, x -> (3x+1)/2 if x is odd. Define the stopping time of x to be the number of steps needed to reach 1. Sequence gives the number of integers x with stopping time n.at n=33A060322
- S-D transform of Catalan numbers A000108.at n=9A121908
- Smallest number k such that the numerator of the generalized harmonic number H(k,n) = Sum_{i=1..k} 1/i^n is a prime.at n=19A125503
- a(n) = (9*n^2 + 9*n - 16)/2.at n=43A166148
- Number of strings of numbers x(i=1..7) in 0..n with sum i^2*x(i)^3 equal to 49*n^3.at n=25A184322
- Numbers k such that 8*R_k + 7*10^k - 1 is prime, where R_k = 11...11 is the repunit (A002275) of length k.at n=7A259137
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 451", based on the 5-celled von Neumann neighborhood.at n=24A272258
- Numbers k such that (11*10^k - 179) / 3 is prime.at n=21A278442
- Write 2*x/(1-x) in the form Sum_{j>=1} ((1-x^j)^a(j) - 1).at n=39A290973