12201
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 19152
- Proper Divisor Sum (Aliquot Sum)
- 6951
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6888
- Möbius Function
- 0
- Radical
- 1743
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 94
- 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
- no
- Odd
- yes
Appears in sequences
- Sum of 5th powers: 0^5 + 1^5 + 2^5 + ... + n^5.at n=6A000539
- a(n) = 1^n + 2^n + ... + 6^n.at n=5A001553
- Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i.at n=46A056219
- A064637 converted to factorial base.at n=13A064477
- Smallest multiple of n with digit sum = 6, or 0 if no such number exists, e.g. a(9k)= 0.at n=48A069525
- Partial sums of cototients arising in A063986.at n=5A073129
- Sum of the (n-1)-th powers of the first n integers.at n=5A076015
- a(n) = (concatenation in ascending order of divisors of 5^n)/5^n.at n=3A077353
- Molien series for symmetrized weight enumerators of self-dual codes over GF(4) + GF(4)u with u^2 = 0.at n=39A092549
- Consider the family of ordinary multigraphs. Sequence gives the triangle read by rows giving coefficients of polynomials arising from enumeration of those multigraphs on n edges.at n=45A098233
- Number of permutations of length n which avoid the patterns 2431, 4123, 4231.at n=8A116819
- Number of permutations of length n which avoid the patterns 1234, 1324, 3421.at n=10A116829
- Arithmetic mean of primes on square intervals such that the mean is an integer.at n=18A161348
- Number of 2 X 2 matrices with all terms in {0,1,...,n} and (sum of terms) = n + 5.at n=35A210377
- Primes written in the factorial base.at n=41A214617
- Triangle read by rows, matrix inverse of [x^(n-k)](skp(n,x)-skp(n,x-1)+x^n) where skp denotes the Swiss-Knife polynomials A153641.at n=29A214622
- Numbers which are the sums of consecutive fifth powers.at n=21A217845
- G.f.: A(x,y) = exp( Sum_{n>=1} [Sum_{k=0..n} C(n,k)^6 * y^k] * x^n/n ) = Sum_{n>=0,k=0..n} T(n,k)*x^n*y^k, as a triangle of coefficients T(n,k) read by rows.at n=22A218116
- G.f.: A(x,y) = exp( Sum_{n>=1} [Sum_{k=0..n} C(n,k)^6 * y^k] * x^n/n ) = Sum_{n>=0,k=0..n} T(n,k)*x^n*y^k, as a triangle of coefficients T(n,k) read by rows.at n=26A218116
- Semiperimeters s of primitive Pythagorean triples (a, b, c) where a, b, c and s are not squarefree.at n=22A237620