14012
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 25536
- Proper Divisor Sum (Aliquot Sum)
- 11524
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6720
- Möbius Function
- 0
- Radical
- 7006
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 89
- 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
- Number of partitions of n into at most 8 parts.at n=43A008637
- Expansion of e.g.f.: sec(cos(x)*log(x+1))=1+1/2!*x^2-3/3!*x^3+4/4!*x^4-40/5!*x^5...at n=8A012472
- Number of partitions of n in which the greatest part is 8.at n=51A026814
- Numbers whose base-7 representation contains exactly four 5's.at n=26A043416
- Numbers k such that S(k+2) = d(k)+2, where S(k) is the Kempner function (A002034) and d(k) is the number of divisors of k (A000005).at n=44A073535
- This sequence and A139143 are complements. a(1) = 1, A139143(1) = 2, a(n+1) = a(n) + Sum_{k = 1..n} A139143(k).at n=40A139142
- Number of 0..n arrays x(0..4) of 5 elements with nondecreasing average value and 0..n occur with instance counts within one of each other.at n=12A200944
- n such that A205592(n) > n.at n=8A205594
- Braille natural numbers (including zero), using "0" as digit concatenation mark.at n=32A220090
- Number of nX2 0..2 arrays with no more than floor(nX2/2) elements unequal to at least one king-move neighbor, with new values introduced in row major 0..2 order.at n=10A222365
- The average of prime factors of n and n+1 is the same.at n=8A227755
- Number of groups of order prime(n)^6.at n=17A232106
- a(n) = 15*n^2 - 13*n.at n=31A263226
- a(n) = 3*p^2+39*p+344+24*gcd(p-1,3)+11*gcd(p-1,4)+2*gcd(p-1,5), where p = prime(n).at n=17A269749
- a(n) = Sum_{k=1..n} C(n, floor((n-k)/k)).at n=16A273160
- The number of partitions of n which represent Chomp positions with Sprague-Grundy value 7.at n=55A284780
- Number of non-isomorphic multiset partitions of weight n using singletons or pairs.at n=12A320663
- Number of strict (distinct parts) plane partitions of n with relatively prime parts.at n=34A323587
- Number of partitions of n into 8 distinct and relatively prime parts.at n=43A340719
- Numbers k such that k divides A243071(k).at n=29A364497