10005
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 7275
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4928
- Möbius Function
- 1
- Radical
- 10005
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that sigma(k) = sigma(k+12).at n=36A015882
- a(n) is least k such that k and 7k are anagrams in base n (written in base 10).at n=38A023099
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 40.at n=4A031718
- Numbers having three 0's in base 10.at n=13A043491
- a(1)=6; if n = Product p_i^e_i, n>1, then a(n) = Product p_{i+1}^e_i * Product p_{i+2}^e_i.at n=37A045969
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049735.at n=28A049737
- Terms of A050530 with four prime divisors.at n=2A053340
- a(n) = 3*n*(4*n-1).at n=29A062783
- Smallest multiple of n in which the string of digits of n occurs after (n-1) most significant digits.at n=4A079847
- Odd composite numbers k such that cototient(k) - phi(k) = k - 2*phi(k) is an odd prime.at n=5A083255
- Least number that requires exactly n iterations of f(x) = reverse(x) - maxdigit(x) to reach zero.at n=18A097156
- Numbers that set a new record for the number of iterations needed to reach 0 under f(x) = reverse(x) - maxdigit(x).at n=15A097158
- 4-Smith numbers.at n=3A103125
- Least sum (n+1) + (n+2) + ... + (n+k) that is a multiple of the n-th triangular number, n(n+1)/2.at n=28A110351
- Least multiple of n in which the n-th digit from left is 5.at n=4A113560
- Least n-digit multiple of n whose digit permutations yield at least n distinct multiples of n, or 0 if no such number exists.at n=4A113599
- Numbers k such that the k-th triangular number contains only digits {0,1,5}.at n=17A119040
- Primitive elements of A119432.at n=18A119433
- Roman numerals with "i" replaced by "1", "v" replaced by "5", "x" replaced by 10, etc., sorted in increasing order.at n=32A130228
- Least k such that k*6*(M(n)^500)-1 is prime where M(i)= i-th Mersenne prime.at n=8A130745