10004
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18228
- Proper Divisor Sum (Aliquot Sum)
- 8224
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4800
- Möbius Function
- 0
- Radical
- 5002
- Omega Function (Ω)
- 4
- 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
- 29
- 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
- Number of spanning trees with degrees 1 and 3 in W_4 X P_n.at n=4A003768
- a(1) = 5; a(n+1) = a(n)-th nonprime, where nonprimes begin at 0.at n=34A025001
- 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 50.at n=41A031548
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 50.at n=3A031728
- "DGK" (bracelet, element, unlabeled) transform of 2,1,1,1,...at n=28A032232
- Four times pentagonal numbers: a(n) = 2*n*(3*n-1).at n=41A033579
- Values of A038007 not ending in 6 or 8.at n=16A038009
- Numbers n with property that n is a substring of its base 5 representation.at n=9A038105
- Numbers whose base-7 representation contains exactly four 1's.at n=27A043400
- Numbers having three 0's in base 10.at n=12A043491
- a(n) = n^4+4 = (n^2-2*n+2)*(n^2+2*n+2) = ((n-1)^2+1)*((n+1)^2+1).at n=10A057781
- Engel expansion of e^gamma (gamma is the Euler-Mascheroni constant A001620) = 1.78107.at n=12A059199
- Numbers n such that sum of digits = number of digits.at n=29A061384
- Triangle, read by rows, in which the n-th row contains n smallest n-digit numbers.at n=14A081551
- Leading terms of rows in A081551.at n=4A081552
- Smallest nontrivial multiple of n whose digit sum is the same as that of the digit sum of n. By nontrivial one means a(n) is not equal to n or (10^k)*n. 0 if no such number exists.at n=39A087303
- Smallest nontrivial multiple of n whose nonzero digit product is the same as that of the nonzero digit product of n. By nontrivial one means a(n) is not equal to n or (10^k)*n. 0 if no such number exists.at n=40A087304
- a(1) = 1; for n >= 1, replace each part, with repetitions, of every part k in each partition of n with a(k), then take the sum to get a(n+1).at n=11A096770
- a(1)= 10000, a(2)= 10000; for n>2, a(n)= ( a(n-2) + a(n-1) ) (mod 20000).at n=4A096973
- Least number that requires exactly n iterations of f(x) = reverse(x) - maxdigit(x) to reach zero.at n=17A097156