10626
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 27648
- Proper Divisor Sum (Aliquot Sum)
- 17022
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2640
- Möbius Function
- -1
- Radical
- 10626
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- no
- Narcissistic Number
- no
- Collatz Steps
- 55
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24.at n=24A000332
- a(n) = (4*n+1)*(4*n+2)*(4*n+3).at n=5A001505
- a(n) = (5*n + 1)*(5*n + 2)*(5*n + 3).at n=4A001509
- a(n) = binomial coefficient C(2n, n - 8).at n=4A004314
- Binomial coefficient C(3n,n-4).at n=4A004322
- a(n) = C(4n,n-2).at n=4A004332
- Binomial coefficient C(6n,n).at n=4A004355
- a(n) = round(n*phi^12), where phi is the golden ratio, A001622.at n=33A004947
- a(n) = ceiling(n*phi^12), where phi is the golden ratio, A001622.at n=33A004967
- a(n) = n*(n-1)*(n-2) (or n!/(n-3)!).at n=23A007531
- Binomial coefficient C(24,n).at n=4A010940
- Binomial coefficient C(24,n).at n=20A010940
- a(n) = binomial(n,20).at n=4A010973
- a(n) = floor(binomial(n,5)/5).at n=25A011851
- a(n) = floor(n(n-1)(n-2)(n-3)/20).at n=23A011930
- a(n) = n*(11*n - 1)/2.at n=44A022268
- Theta series of A*_22 lattice.at n=34A023934
- Binomial coefficients: C(n,k), 4 <= k <= n-4, sorted, duplicates removed.at n=31A024756
- a(n) = least m such that if r and s in {1/2, 1/5, 1/8, ..., 1/(3n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=45A024837
- a(n) = lcm(n,n+1,n+2).at n=20A033931