10500
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
- 48
- Divisor Sum
- 34944
- Proper Divisor Sum (Aliquot Sum)
- 24444
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2400
- Möbius Function
- 0
- Radical
- 210
- Omega Function (Ω)
- 7
- 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
- yes
- 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
- Theta series of A_5 lattice.at n=43A008445
- Theta series of A_6 lattice.at n=14A008446
- Triangle of coefficients in expansion of (1+5x)^n.at n=48A013612
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (odd natural numbers).at n=30A024590
- Number of distinct prime signatures of the positive integers up to 2^n.at n=48A025488
- Number of rooted planar trees where any 2 subtrees extending from same node have a different number of nodes.at n=12A032010
- Four times pentagonal numbers: a(n) = 2*n*(3*n-1).at n=42A033579
- Numbers that can be expressed as the product of two 3-digit numbers in at least one way.at n=9A033829
- Number of partitions of n such that cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5) <= cn(1,5).at n=62A036854
- Triangle whose (i,j)-th entry is 5^(i-j)*binomial(i,j).at n=51A038243
- Numbers having three 0's in base 10.at n=31A043491
- Numbers k such that the sum of the squares of the divisors of k is divisible by k.at n=24A046762
- Internal digits of n^2 include digits of n as subsequence.at n=36A046834
- A convolution triangle of numbers generalizing Pascal's triangle A007318.at n=24A049326
- Expansion of (1-25*x)^(-4/5).at n=3A049382
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 2 skipped primes.at n=45A050769
- Numbers k > 1 such that, in base 4, k and k^2 contain the same digits in the same proportion.at n=42A061658
- Generalized Stirling numbers.at n=3A061689
- Triangle of generalized Stirling numbers.at n=18A061691
- Numbers k such that cototient(k) is a square and sets a new record for squares.at n=26A063753