14156
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 24780
- Proper Divisor Sum (Aliquot Sum)
- 10624
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7076
- Möbius Function
- 0
- Radical
- 7078
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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
- Interprimes which are of the form s*prime, s=4.at n=40A075279
- 5th diagonal of triangle in A059317.at n=22A106113
- One third of the sum of the first n primes, when an integer.at n=41A112270
- Egyptian fraction representation for the cube root of 38.at n=2A132513
- Triangle T(n, k) = coefficients of p(x,n), where p(x,n) = ((1-x)^(2*n+1)/x^n) * Sum_{j >= n} ( (2*j+1)^n * binomial(j, n) * x^j ), read by rows.at n=11A156654
- Number of -7..7 arrays x(0..n-1) of n elements with sum zero and with zeroth through n-1st differences all nonzero.at n=4A200037
- T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with sum zero and with zeroth through n-1st differences all nonzero.at n=59A200038
- Number of -n..n arrays x(0..4) of 5 elements with sum zero and with zeroth through 4th differences all nonzero.at n=6A200041
- Second row of array defined in A056230.at n=10A200379
- 8-step Fibonacci sequence starting with 0,0,1,0,0,0,0,0.at n=22A251744
- G.f. satisfies: A(x - A(x)^2) = x + A(x)^2.at n=5A275765