12576
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 33264
- Proper Divisor Sum (Aliquot Sum)
- 20688
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4160
- Möbius Function
- 0
- Radical
- 786
- Omega Function (Ω)
- 7
- 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
- 63
- 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
- Conjectured formula for irreducible 5-fold Euler sums of weight 2n+13.at n=42A019450
- Least term in period of continued fraction for sqrt(n) is 7.at n=22A031431
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,43.at n=1A064258
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,45.at n=6A064259
- Number of compositions of n into 5 parts such that no two adjacent parts are equal.at n=21A106354
- a(n) = 49*n^2 + 2*n.at n=15A157365
- Number of fixed poly-[4.8^2]-tiles (holes allowed) with n cells (division into triangles is significant).at n=10A197467
- Number of partitions of n such that the number of parts and the largest part and the smallest part are pairwise not coprime.at n=53A200476
- (n-1)-st elementary symmetric function of {1,1,2,2,3,3,4,4,5,5,...,Floor[(n+1)/2]}.at n=8A203151
- (n-1)-st elementary symmetric function of the first n terms of (1,2,3,4,5,1,2,3,4,5,...)=A010884.at n=8A203166
- 12 times the total number of smallest parts in all partitions of n, with a(0) = 0.at n=17A211609
- prime(n^2) - prime(n).at n=38A213926
- Phi(n) values in A115921.at n=32A216381
- Number of 0..n arrays of length 6 with each element differing from at least one neighbor by 1 or less, starting with 0.at n=24A221685
- Irregular triangle read by rows: T(n,k) = number of set partitions of [1..n] with intertwining weight k.at n=41A226505
- a(n) is a refactorable number and the sum of all refactorable numbers <= a(n) is also a refactorable number.at n=23A235177
- Number of parity preserving permutations of the set {1,2,...,n} with exactly k cycles.at n=57A246117
- Number of length n 1..(1+2) arrays with no leading partial sum equal to a prime.at n=16A254532
- Triangle read by rows, T(n,k) = sum(j=0..k-1, S(n+1,j+1)*S(n,k-j)) where S denotes the Stirling cycle numbers A132393, T(0,0)=1, n>=0, 0<=k<=2n.at n=27A254881
- Expansion of (A(x)^2 - A(x^2))/2 where A(x) = A000108(x) - 1.at n=10A275206