12760
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 32400
- Proper Divisor Sum (Aliquot Sum)
- 19640
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4480
- Möbius Function
- 0
- Radical
- 3190
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 76
- 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
- Coordination sequence for MgCu2, Mg position.at n=28A009931
- Number of singular 2 X 2 matrices over Z(n) (i.e., with determinant = 0).at n=19A020478
- [ (4th elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+3 positive integers congruent to 2 mod 3}.at n=4A024400
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 11 (most significant digit on left).at n=35A029456
- Number of bracelets (turnover necklaces) of n beads of 2 colors, 7 of them black.at n=19A032280
- Number of partitions in parts not of the form 23k, 23k+3 or 23k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=38A035991
- Number of partitions satisfying cn(1,5) <= cn(2,5) + cn(3,5) and cn(4,5) <= cn(2,5) + cn(3,5).at n=37A039890
- a(n) = Product_{i=0..n-1} (9*i+2).at n=4A084949
- Numbers k such that k!!!!!! + 1 is prime.at n=41A085150
- Triangle read by rows: T(n,k) = number of Dyck paths of semilength n having k peaks at odd height.at n=68A091867
- Positions of records in A110566.at n=17A112809
- Nonuple factorial, 9-factorial, n!9, n!!!!!!!!!.at n=29A114806
- a(n) = a(n-2) + A000265(a(n-1)), a(0)=0, a(1)=1.at n=32A114990
- Numbers n such that sigma(n) and sigma(sigma(n)) are both perfect squares.at n=5A134263
- a(n) = n*(8*n-1).at n=40A139274
- a(n) = 4*(4 + 9*n^2 + 15*n).at n=18A144449
- Convolution square of A003106.at n=41A145468
- Terms of A061039 that are multiple of 10, in the order in which they appear.at n=22A146762
- Triangle T(n, k, m) = t(n,m)/( t(k,m) * t(n-k,m) ) with T(n, 0, m) = T(n, n, m) = 1, where t(n, m) = Product_{j=1..n} Product_{i=1..j-1} ( 1 - (m+1)*(3*i-2) ) and m = 2, read by rows.at n=16A156725
- Triangle T(n, k, m) = t(n,m)/( t(k,m) * t(n-k,m) ) with T(n, 0, m) = T(n, n, m) = 1, where t(n, m) = Product_{j=1..n} Product_{i=1..j-1} ( 1 - (m+1)*(3*i-2) ) and m = 2, read by rows.at n=19A156725