12978
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 32448
- Proper Divisor Sum (Aliquot Sum)
- 19470
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3672
- Möbius Function
- 0
- Radical
- 4326
- 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
- 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
- 50
- 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
- Expansion of 1/((1-x)(1-9x)(1-11x)(1-12x)).at n=3A025130
- a(n) = ceiling((n + 1/2)^3).at n=22A034131
- a(n) is the number of different degrees in the sequence of the degrees of the irreducible representations of the symmetric group S_n, i.e., count each degree only once.at n=38A060437
- Product of sums of divisors and non-divisors.at n=25A066859
- Triangle read by rows: T(n,k) gives the number of set partitions of {1,...,n} with maximum block length k.at n=49A080510
- Let u(1)=0, u(2)=1, u(k)=u(k-1)+u(k-2)/(k-2); then a(n)=n!*u(n).at n=6A086325
- a(n) is the smallest integer k such that the n-th (forward) difference of the partition sequence A000041 is positive from k onwards.at n=28A119712
- Triangle read by rows: T(n,k) is the number of partial bijections (or subpermutations) of an n-element set of height k (height(alpha) = |Im(alpha)|) and with exactly 1 fixed point.at n=26A144090
- Number of reduced words of length n in the Weyl group E_8 on 8 generators and order 696729600.at n=10A162494
- Triangle read by rows: a(n,k) is the number of permutations of n elements with prefix transposition distance equal to k.at n=39A164645
- Number of (n+3)X(n+3) 0..1 matrices with each 4X4 subblock idempotent.at n=10A224560
- a(n) = floor(M(g(n-1)+1, ..., g(n))), where M = harmonic mean and g(n) = n^3.at n=23A227012
- Number of set partitions of {1,...,n} with largest set of size 5.at n=5A229247
- a(n) = [x^n] Product_{k=1..n} 1/(x^k*(1-x^k)^3).at n=4A258792
- Numbers n = concat(s,t) such that sigma(n) - n = sigma(s) * sigma(t), where sigma(n) - n is the sum of the aliquot parts of n.at n=9A271632
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 501", based on the 5-celled von Neumann neighborhood.at n=26A272566
- Number of set partitions of [2n] with largest set of size n.at n=5A276961
- Expansion of Sum_{p prime, k>=1} x^(p^k)*(1 - x)^2/(1 - 2*x)^2.at n=12A284943
- Records of the maxima of the unitary aliquot sequences of the numbers in A290145.at n=7A290146
- a(n) = 102*2^n - 78.at n=7A305159