10620
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
- 36
- Divisor Sum
- 32760
- Proper Divisor Sum (Aliquot Sum)
- 22140
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2784
- Möbius Function
- 0
- Radical
- 1770
- Omega Function (Ω)
- 6
- 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
- 55
- 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
- a(n) = (n + 3)*(n^2 + 6*n + 2)/6.at n=37A005286
- Expansion of Product_{m>=1} (1+q^m)^(-9).at n=10A022604
- Number of nonnegative solutions of x1^2 + x2^2 + ... + x10^2 = n.at n=17A045852
- T(n,n-1), array T as in A047030.at n=8A047033
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049723.at n=26A049726
- a(n) is the number of pairs of integer quadruples (b_1, b_2, b_3, b_4) and (c_1, c_2, c_3, c_4) satisfying 1 <= b_1 < b_2 < b_3 < b_4 < n, 1 <= c_1 < c_2 < c_3 < c_4 < n, b_i != c_j for all i,j = 1,2,3,4 and Product_{i=1..4} sin(2*Pi*b_i/n) = Product_{i=1..4} sin(2*Pi*c_i/n).at n=48A063781
- Expansion of Product_{k>=1} (1+x^k)^A001055(k).at n=37A066806
- Numbers k such that sigma(k) divides sigma(sigma(k)).at n=22A066961
- Row sums of the triangle (A084783) and the differences of the main diagonal (A084785) and the first column (A084784).at n=6A084786
- Numbers k such that 2^k - 1 is divisible by (k-1).at n=18A087965
- a(2*n+1) = 9*a(n), a(2*n+2) = 10*a(n) + a(n-1).at n=29A116555
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=7.at n=32A135192
- a(n) = n*(8*n+7).at n=36A139278
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (1, 0, 0), (1, 1, -1), (1, 1, 1)}.at n=7A150752
- Six times hexagonal numbers: 6*n*(2*n-1).at n=30A152746
- Number of reduced words of length n in the Weyl group A_39.at n=3A161652
- Number of binary strings of length n with equal numbers of 0001 and 0101 substrings.at n=15A164158
- Number of binary strings of length n with equal numbers of 00000 and 00100 substrings.at n=14A164181
- a(n) = 12*a(n-1) - 33*a(n-2) for n > 1; a(0) = 4, a(1) = 27.at n=4A164311
- Even numbers which are the sum of two odd abundant numbers.at n=38A168226