12650
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 26784
- Proper Divisor Sum (Aliquot Sum)
- 14134
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4400
- Möbius Function
- 0
- Radical
- 2530
- 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
- yes
- 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
- 81
- 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
- Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24.at n=25A000332
- Number of compositions of n into 4 ordered relatively prime parts.at n=42A000742
- a(n) = (7*n+1)*(7*n+2)*(7*n+4).at n=3A001547
- Degrees of irreducible representations of Conway group Co2.at n=13A003911
- Binomial coefficient C(5n,n-1).at n=4A004343
- Number of intersections of diagonals in the interior of a regular n-gon.at n=24A006561
- 9-gonal (or enneagonal) pyramidal numbers: a(n) = n*(n+1)*(7*n-4)/6.at n=22A007584
- Binomial coefficient C(25,n).at n=4A010941
- Binomial coefficient C(25,n).at n=21A010941
- a(n) = binomial(n,21).at n=4A010974
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (composite numbers).at n=32A024480
- Binomial coefficients: C(n,k), 4 <= k <= n-4, sorted, duplicates removed.at n=35A024756
- Number of unlabeled (and unrooted) trees on n nodes having a centroid.at n=16A027416
- Numbers k in which the digits of k^2 appear.at n=23A029774
- Numbers k such that k and k^2 have the same set of digits.at n=12A029793
- Decimal part of cube root of a(n) starts with 3: first term of runs.at n=21A034129
- Number of partitions satisfying (cn(0,5) <= cn(2,5) = cn(3,5) and cn(2,5) <= cn(1,5) and cn(2,5) <= cn(4,5)).at n=53A036816
- T(n,4), array T as in A050186; a count of aperiodic binary words.at n=21A050189
- a(n) = binomial(n, floor(n/6)).at n=25A051053
- Binomial coefficients binomial(2*n-3,4).at n=10A053126