9002
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15456
- Proper Divisor Sum (Aliquot Sum)
- 6454
- 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
- 3852
- Möbius Function
- -1
- Radical
- 9002
- 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
- Number of generalized weak orders on n points.at n=5A004123
- Number of points on surface of cuboctahedron (or icosahedron): a(0) = 1; for n > 0, a(n) = 10n^2 + 2. Also coordination sequence for f.c.c. or A_3 or D_3 lattice.at n=30A005901
- a(0) = 1, a(n) = 40*n^2 + 2 for n>0.at n=15A010022
- a(n) = n*(23*n - 1)/2.at n=28A022280
- Numbers k such that k*(k+7) is a palindrome.at n=11A028564
- Array read by antidiagonals: generalized ordered Bell numbers Bo(r,n).at n=19A094416
- Indices of primes in sequence defined by A(0) = 59, A(n) = 10*A(n-1) - 71 for n > 0.at n=11A101572
- Smallest sequence which lists the position of digits "8" in the sequence.at n=35A167450
- Triangle T(n,k), read by rows, given by (0, 2, 3, 4, 6, 6, 9, 8, 12, 10, 15, ...) DELTA (1, 0, 1, 0, 1, 0, 1, 0, 1, 0, ...) where DELTA is the operator defined in A084938.at n=22A185285
- G.f. 1/sum(k>=0, (-1)^k * x^(k*(k+1)/2)).at n=40A208061
- E.g.f.: Product_{n>=1} 1/(1 - tanh(x^n/n)).at n=7A218504
- Number of 5 X n 0..1 arrays with antidiagonals unimodal and rows and diagonals nondecreasing.at n=12A224041
- Numbers n such that 6n -/+ 1 are twin prime pair and n = r + s where 6r -/+ 1 and 6s -/ 1 are consecutive smaller pairs of twin primes.at n=54A226652
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 595", based on the 5-celled von Neumann neighborhood.at n=13A283213
- T(n, k) = F(n - k, k), where F(n, x) is the Fubini polynomial. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=30A344499
- a(n) is the total number of paths starting at (0, 0), ending at (n, 0), consisting of steps (1, 1), (1, 0), (1, -3), and staying on or above y = -2.at n=12A379464
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where A(n,k) = Sum_{i=0..k*n} 2^i * Sum_{j=0..i} (-1)^j * binomial(i,j) * binomial(i-j,n)^k.at n=22A384362
- a(n) is the number of multisets of n decimal digits where the sum of the digits equals the product of the prime digits.at n=21A384445