12500
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 27342
- Proper Divisor Sum (Aliquot Sum)
- 14842
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5000
- Möbius Function
- 0
- Radical
- 10
- Omega Function (Ω)
- 7
- 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
- 125
- 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
- yes
- Achilles Number
- yes
- Perfect Power
- no
- Smooth Number
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Numbers of the form 2^i*5^j with i, j >= 0.at n=49A003592
- a(0) = 1; a(n) = 4*5^(n-1) for n >= 1.at n=6A005054
- Integers of the form Product p_j^k_j = Product k_j^p_j; p_j in A000040.at n=10A008478
- a(n) = Product_{j=0..5} floor((n+j)/6).at n=29A008881
- Triangle of coefficients in expansion of (4 + 5*x)^n.at n=19A013628
- Positive numbers k such that k and 2*k are anagrams in base 9 (written in base 9).at n=21A023079
- Positive numbers k such that k and 4*k are anagrams in base 9 (written in base 9).at n=11A023081
- Numbers of form 4^i*5^j, with i, j >= 0.at n=26A025617
- Numbers of form 5^i*10^j, with i, j >= 0.at n=17A025625
- a(n) = 5*a(n-2), starting 1,2,4.at n=12A026395
- Numbers k such that 165*2^k+1 is prime.at n=51A032459
- Numbers k such that A174141(k) is divisible by k.at n=38A032581
- a(n) = floor(10^5/n).at n=7A033427
- a(n) = 5*n^2.at n=50A033429
- Numbers whose prime factors are 2 and 5.at n=30A033846
- Composite numbers whose prime factors contain no digits other than 2 and 5.at n=46A036311
- Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*4^j.at n=16A038246
- Ambitious numbers: numbers n with the property that if a number ends in n then it is divisible by n.at n=18A039690
- a(n+1) = a(n) + (n^2 + 1)*a(n-1).at n=7A047990
- Numbers k such that if k = Product p_i^e_i then p_i = e_i for all i.at n=5A048102