10908
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 28560
- Proper Divisor Sum (Aliquot Sum)
- 17652
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3600
- Möbius Function
- 0
- Radical
- 606
- Omega Function (Ω)
- 6
- 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
- 130
- 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 achiral planted trees with n nodes.at n=19A005627
- Number of partitions of n into parts of 12 kinds.at n=5A005758
- Numbers that can be expressed as the product of two 3-digit numbers in at least one way.at n=26A033829
- Number of partitions satisfying cn(1,5) + cn(4,5) <= cn(0,5) + cn(2,5) and cn(1,5) + cn(4,5) <= cn(0,5) + cn(3,5).at n=41A039864
- Number of nondividing sets on {1,2,...,n}.at n=35A051014
- Number of distinct minimal unary DFA's with exactly n states.at n=10A059412
- Numbers k such that k + the reversal of k is a square.at n=36A061230
- Numbers k such that sigma(k) = 2*usigma(k).at n=31A063880
- Length of period of continued fraction for square root of -1 + n!.at n=11A078146
- 33-gonal numbers: n(31n-29)/2.at n=27A098923
- Expansion of x^4/((1-2*x)*(x^2-x+1)*(x-1)^2).at n=15A111926
- Second diagonal of Gely numbers.at n=14A132796
- Recursive triangular sequence: A(n,k)= A(n - 1, k - 1) + A(n - 1, k) + (3 (-1 + n) (-4 + 3 n))*A(n - 2, k - 1).at n=12A153821
- Coefficients of modular function denoted g_5(tau) by Atkin.at n=5A186209
- Number of n X 2 0..3 arrays with rows and columns lexicographically nondecreasing read forwards and nonincreasing read backwards.at n=29A201975
- Number of groups of order prime(n)^6.at n=15A232106
- a(n) = n*(n^2 + 3*n - 2)/2.at n=27A256857
- Number of permutations of length n having exactly one descent such that the first element of the permutation is an odd number.at n=13A257198
- a(n) = 3*p^2+39*p+344+24*gcd(p-1,3)+11*gcd(p-1,4)+2*gcd(p-1,5), where p = prime(n).at n=15A269749
- Triangle read by rows: T(n,k) is the number of polygons formed by connecting the vertices of a regular {2*n+1}-gon such that they make k turns around the center point.at n=34A330660