14128
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
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 27404
- Proper Divisor Sum (Aliquot Sum)
- 13276
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7056
- Möbius Function
- 0
- Radical
- 1766
- Omega Function (Ω)
- 5
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 32
- 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-9) for n >= 9; a(n) = 1 for n=0..7; a(8) = 2.at n=53A005711
- If p(x) is the x-th prime, then the n-th set of 4 consecutive sexy prime pairs starts at p(a(n)).at n=21A095963
- If p(x) is the x-th prime, then the n-th set of 5 consecutive sexy prime pairs starts at p(a(n)).at n=5A095964
- Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k low humps.at n=48A101281
- Number of binary rooted trees with n nodes and internal path length n.at n=44A108643
- G.f.: 1/(1-2*x-6*x^2+4*x^3).at n=8A124023
- Positive integers of the form (7*m^2+1)/11.at n=27A179370
- Number of chess tableaux with n cells.at n=15A238014
- Numbers for which the cube of the sum of the digits is equal to the square of the product of their digits.at n=16A241846
- Sum of all proper divisors of all positive integers <= prime(n).at n=46A244576
- Smallest base b > 1 such that both prime(n) and prime(n+1) are base-b Wieferich primes, i.e., p = prime(n) satisfies b^(p-1) == 1 (mod p^2) and q = prime(n+1) satisfies b^(q-1) == 1 (mod q^2).at n=43A259075
- Number of (n+1) X (2+1) arrays of permutations of 0..n*3+2 with each element having directed index change 0,0 1,1 0,-1 -1,1 or 0,-2.at n=6A264238
- T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,0 1,1 0,-1 -1,1 or 0,-2.at n=34A264244
- Row sums of A285117: a(n) = 2 + Sum_{k=1..(n-1)} C(n-1,k-1) XOR C(n-1,k), a(0) = 1, a(1) = 2.at n=15A285114
- Number of Dyck paths of semilength n such that the maximal number of peaks per level equals nine.at n=6A288750
- Number of compositions (ordered partitions) of n into squares dividing n.at n=54A294105
- a(n) = Sum_{k=1..n} floor(n/k)^3.at n=22A318742
- Number of distinct length-n necklaces on a size-2 alphabet.at n=36A344779
- G.f. A(x) satisfies: A(x) = (1 + x * A(x)^3) / (1 - x).at n=6A346626
- Smallest m such that A357477(m) = n.at n=32A357675