14008
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 28080
- Proper Divisor Sum (Aliquot Sum)
- 14072
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 6528
- Möbius Function
- 0
- Radical
- 3502
- Omega Function (Ω)
- 5
- 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
- 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
- Number of plane partitions of n with at most two rows.at n=22A000990
- Distinct even elements in 3-Pascal triangle A028262 (by row).at n=41A028269
- Even elements to right of central elements in 3-Pascal triangle A028262.at n=36A028273
- Numbers k > 1 such that, in base 5, k and k^2 contain the same digits in the same proportion.at n=7A061659
- Numbers k such that 100k+1, 100k+3, 100k+7, 100k+9 are all primes.at n=21A064687
- Triangle, read by rows, where row n forms a polynomial in y=3*k that generates diagonal n as k=0,1,2,... for n>=0; thus T(n,k) = Sum_{j=0..n-k} T(n-k,j)*(3*k)^j, with T(n,0)=T(n,n)=1.at n=22A113716
- Column 1 of triangle A113716, in which row n forms a polynomial in y=3*k that generates diagonal n as k=0,1,2,... for n>=0.at n=5A113717
- Numbers k such that k^2 divides 9^k - 1.at n=35A127101
- Expansion of 1/(1 - x^4 - x^5 - x^6 + x^10).at n=56A147652
- Number of triangles that can be built from rods with lengths 1,2,...,n by using and concatenating all rods.at n=37A160455
- Regular triangle, T(n, k) = f(n, k) - f(n, 0) + 1, where f(n, k) = Sum_{j=0..k} StirlingS2(n, n-j)*binomial(n,j) + Sum_{j=0..n-k} StirlingS2(n, n-j)*binomial(n, j), read by rows.at n=31A176157
- Regular triangle, T(n, k) = f(n, k) - f(n, 0) + 1, where f(n, k) = Sum_{j=0..k} StirlingS2(n, n-j)*binomial(n,j) + Sum_{j=0..n-k} StirlingS2(n, n-j)*binomial(n, j), read by rows.at n=32A176157
- Number of (n+1) X (1+1) 0..6 arrays with every 2 X 2 subblock summing to a prime.at n=1A251611
- Number of (n+1)X(2+1) 0..6 arrays with every 2X2 subblock summing to a prime.at n=0A251612
- T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock summing to a prime.at n=1A251616
- T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock summing to a prime.at n=2A251616
- Numbers whose abundance is a power of 2.at n=44A259174
- Positive integers congruent to 0 or 1 modulo 4 that cannot be written as x^3 + y^2 + z^2 with x,y,z nonnegative integers.at n=12A275083
- Numbers n whose abundance is 64: sigma(n) - 2n = 64.at n=4A275996
- Number of compositions of n that are both a reversed necklace and a co-necklace.at n=20A334271