9008
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 17484
- Proper Divisor Sum (Aliquot Sum)
- 8476
- 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
- 4496
- Möbius Function
- 0
- Radical
- 1126
- Omega Function (Ω)
- 5
- 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
- 47
- 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 that are the sum of 10 positive 7th powers.at n=40A003377
- Apply partial sum operator thrice to primes.at n=15A014150
- Least k such that first k terms of A022300 contain n more 2's than 1's.at n=9A025515
- Numbers whose base-4 representation contains exactly four 0's and two 3's.at n=28A045083
- Numbers k such that (3^k - 7)/2 is prime.at n=12A063679
- Symmetric square array, read by antidiagonals: T(k, k) = T(0, k + 1) = Sum_{m = 0..k} C(k, m)*T(m, k - m) for k >= 0; T(0, 0) = 1; T(n, k) = T(n - 1, k) + T(n, k - 1) for n, k >= 1.at n=28A085484
- Symmetric square array, read by antidiagonals: T(k, k) = T(0, k + 1) = Sum_{m = 0..k} C(k, m)*T(m, k - m) for k >= 0; T(0, 0) = 1; T(n, k) = T(n - 1, k) + T(n, k - 1) for n, k >= 1.at n=35A085484
- First row of symmetric square table A085484, in which the main diagonal is equal to the first row shift left.at n=7A085485
- Least positive multiples of index n that can result from the self-convolution of a monotonically increasing sequence (A087148).at n=49A087149
- Numbers k such that k*(k+6) gives the concatenation of two numbers m and m-7.at n=1A116242
- Smallest j such that j*2*p(n)^3-1=q is prime, j*2*p(n)*q^2-1=r, j*2*p(n)*r^2-1=s, where r and s are also prime.at n=38A224611
- Floor(1/s(n)), where s(n) = (2n+1)/(2n+2) - n*log((n+1)/n).at n=37A227721
- Number of partitions p of n such that (number of numbers in p of form 3k+2) = (number of numbers in p of form 3k).at n=39A241741
- Numbers equal to the arithmetic derivative of their Euler totient function.at n=30A248815
- Numbers k such that the number of divisors of k+2 divides k and the number of divisors of k divides k+2.at n=44A268037
- Numbers n such that n^1024 + (n+1)^1024 is prime.at n=12A274234
- Numbers k such that (17*10^k - 47)/3 is prime.at n=17A286177
- E.g.f.: 1/Product_{k>0} (1-x^(2*k-1)/(2*k-1)).at n=7A294506
- Solution of the complementary equation a(n) = a(1)*b(n-2) + a(2)*b(n-3) + ... + a(n-1)*b(0), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=7A296217
- Expansion of e.g.f. Product_{k>=1} 1 / (1 - arcsin(x^k)).at n=6A330534