12966
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 25944
- Proper Divisor Sum (Aliquot Sum)
- 12978
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- -1
- Radical
- 12966
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 169
- 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
- a(n) = dot_product(1,2,...,n)*(7,8,...,n,1,2,3,4,5,6).at n=29A026049
- a(n) = self-convolution of row n of array T given by A026148.at n=6A027329
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,13.at n=8A064243
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,21.at n=18A064247
- Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,65.at n=4A065700
- Number of those nonnegative integer solutions of the congruence x_1+2x_2+...+(n-1)x_{n-1} = 0 (mod n) which are indecomposable, that is, are not nonnegative linear combinations of other nonnegative integer solutions.at n=20A096337
- s(n) = floor(n^(n/5)/n!!!!!).at n=58A114869
- Number of n X 6 binary arrays with all 1s connected and a path of 1s from top row to lower right corner.at n=2A163015
- Number of nX3 binary arrays with all 1s connected and a path of 1s from left column to lower right corner.at n=5A163020
- Number of partitions of n into distinct parts with boundary size 6.at n=45A227563
- Trisection of A107926: The least number k such that there are primes p and q with p - q = 6*n+4, p + q = k, and p the least such prime >= k/2.at n=28A234956
- Number of partitions p of n such that (number of distinct parts of p) < max(p) - min(p).at n=35A239954
- Number of partitions p of n such that the number of distinct parts is a part or max(p) - min(p) is a part.at n=38A241391
- Primitive abundant numbers (A091191) with a record gap to the next primitive abundant number.at n=10A334418
- Number of partitions of the n-th n-gonal number into n-gonal numbers.at n=12A337762
- a(n) = Sum_{1 <= x_1 <= x_2 <= ... <= x_n = n} gcd(x_1, x_2, ... , x_n).at n=8A343553
- Expansion of Product_{k>=1} 1 / (1 - x^(3*k-1))^2.at n=53A374018
- Number of polyforms with n cells on the faces of a deltoidal icositetrahedron up to rotation and reflection.at n=16A383804
- Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with all 1's connected and a path of 1's from top row to lower right corner.at n=30A391489