12076
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
- 6
- Divisor Sum
- 21140
- Proper Divisor Sum (Aliquot Sum)
- 9064
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6036
- Möbius Function
- 0
- Radical
- 6038
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- 68
- 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
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 10.at n=16A022324
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 98 ones.at n=1A031866
- Number of partitions of n into parts not of the form 25k, 25k+6 or 25k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=35A036005
- a(n) = number of partitions of primes into distinct (also odd) parts.at n=17A064688
- a(n) = floor(surface area of a sphere with radius n).at n=30A066644
- Number of ways to partition 2n+1 into distinct positive integers.at n=30A078408
- Number of ways to partition 4*n+1 into distinct positive integers.at n=15A078409
- a(n) = 49n^2 - 28n - 20.at n=15A118058
- Even values of the PartitionsQ function A000009.at n=48A118303
- a(0) = 0, a(1) = 1; for n > 1, a(n+1) = (2*n + 1)*a(n) + n^4*a(n-1).at n=5A142999
- A symmetrical triangle of polynomial coefficients:p(x,n)=If[n == 0, 1, (1 - x)^(n + 1)*Sum[((2*k + 1)^n + (k + 1)^n + k^n)*x^k, {k, 0, Infinity}]/2].at n=24A177984
- Integers of the form: 0/3 + 1/3 + 2/3 + 3/3 + 5/3 + 7/3 + 11/3 + 13/3 + 17/3 + ....at n=43A182155
- Number of 2 X 2 nonsingular 0..n matrices with a(1,1) <= a(1,2) <= a(2,1) <= a(2,2).at n=20A183763
- Number of 7's in the last section of the set of partitions of n.at n=48A206557
- Number of (n+1) X (1+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or antidiagonally.at n=11A232901
- Number of (n+1)X(1+1) 0..2 arrays colored with the maximum plus the lower median minus the upper median of every 2X2 subblock.at n=3A236698
- Number of (n+1)X(4+1) 0..2 arrays colored with the maximum plus the lower median minus the upper median of every 2X2 subblock.at n=0A236701
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the maximum plus the lower median minus the upper median of every 2X2 subblock.at n=6A236704
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the maximum plus the lower median minus the upper median of every 2X2 subblock.at n=9A236704
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 411", based on the 5-celled von Neumann neighborhood.at n=36A288048