10062
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 24024
- Proper Divisor Sum (Aliquot Sum)
- 13962
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3024
- Möbius Function
- 0
- Radical
- 3354
- Omega Function (Ω)
- 5
- 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
- 117
- 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 rooted maps with n edges on the projective plane.at n=4A007137
- G.f.: Product_{k>=1} (1 + 2*x^k).at n=32A032302
- Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(4,5) + cn(2,5) + cn(3,5).at n=32A039849
- Numbers k such that 63*2^k-1 is prime.at n=34A050557
- a(n) = 3*(n - 2)*(5*n -11).at n=26A060785
- Least number that requires exactly n iterations of f(x) = reverse(x) - maxdigit(x) to reach zero.at n=20A097156
- Numbers that set a new record for the number of iterations needed to reach 0 under f(x) = reverse(x) - maxdigit(x).at n=17A097158
- Numbers k such that 2*F(k) + 1 is a prime, where F = A000045.at n=46A124067
- Number of nondecreasing integer sequences of length 19 with sum zero and sum of absolute values 2n.at n=12A158153
- Number of partitions where the number of 1's and 2's are equal.at n=45A174455
- Number of 2 X 2 matrices with all elements in {0,1,...,n} and determinant in {-1,0,1}.at n=31A209993
- Sophie Germain 5-almost primes.at n=12A211162
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and 2w+x+y>2.at n=14A211619
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2w^2>x^2+y^2.at n=27A211810
- Number of times the digit 5 appears in the first 10^n digits of Catalan's constant.at n=4A224774
- a(n) = n*(11*n-5)/2.at n=43A226492
- G.f.: Product_{k>=1} (1+x^k)^(3*k+1).at n=9A255836
- Number x such that sigma(x) = usigma(x) + (-1)sigma(x), where sigma(x) is the sum of divisors of x (A000203), usigma(x) is the sum of unitary divisors of x (A034448) and (-1)sigma(x) is defined in A049060.at n=3A258106
- Number of triangular number parts in all partitions of n.at n=25A263235
- Triangle read by rows: T(n,k) = number of rooted maps with n edges on a nonorientable surface of genus k (1 <= k <= n).at n=10A267180