10040
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
- 16
- Divisor Sum
- 22680
- Proper Divisor Sum (Aliquot Sum)
- 12640
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4000
- Möbius Function
- 0
- Radical
- 2510
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 91
- 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 factorization patterns of polynomials of degree n over integers.at n=19A006171
- Least term in period of continued fraction for sqrt(n) is 5.at n=34A031429
- Numbers having three 0's in base 10.at n=21A043491
- Composites whose sum of digits equals number of its prime factors, with multiplicity.at n=38A050689
- McKay-Thompson series of class 39A for Monster.at n=45A058659
- a(n) = A053061(n)/n.at n=39A061082
- Numbers n such that sum of digits = number of digits.at n=33A061384
- a(1) = 1, a(n+1) is the sum of a(n) and ceiling( arithmetic mean of a(1) ... a(n) ).at n=33A065095
- Multiples of 5 with digit sum 5.at n=22A069540
- Smallest n-digit multiple of n with digit sum n.at n=4A077757
- Triangle read by rows: n-th row contains the first n n-digit multiples of n with digit sum n. If there are fewer than n such numbers, the rest of the row is filled with 0's.at n=10A084029
- Non-palindromic numbers n such that phi(n) = phi(reversal(n)).at n=13A097647
- a(n) is the least non-palindromic number m such that phi(m)=phi(reversal(m))=4*10^(n+2), or 0 if no such number exists.at n=0A097648
- Composite solutions to the equation reversal(x) - phi(x) = 1.at n=4A130000
- Numbers k such that for any single digit d of k the d-th semiprime sp(k) is substring of k.at n=17A135441
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 6 and 8.at n=40A136861
- a(n) = 25*n^2 + 2*n.at n=19A154377
- Those positive integers n where, when written in binary, there are exactly k number of runs (of either 0's or 1's) each of exactly k length, for all k where 1<=k<=m, for some positive integer m.at n=13A175356
- a(n) = n^4 + 4*n.at n=10A180354
- Number of 10 X 2 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 10 zero-sum 2-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=11A192711