14116
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
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 24710
- Proper Divisor Sum (Aliquot Sum)
- 10594
- 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
- 7058
- 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
- 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
- Length of n-th term of A022482.at n=31A022483
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 88 ones.at n=10A031856
- Numbers whose set of base-8 digits is {3,4}.at n=37A032832
- Let M(n) be the n X n matrix m(i,j)=min(i,j) for 1<=i,j<=n; then a(n) is the trace of M(n)^(-7).at n=5A114359
- Values of x in solutions (x,y,z) to the Diophantine equation x^3-x^2+y^3-y^2=z^3-z^2, with 1<x<y<z.at n=26A138667
- Let M(n) = maximal value of (n/k)^k over all k = 1, 2, ...; a(n) = floor(M(n)).at n=25A139076
- a(n) = coefficient of x^n in the (n-1)-th iteration of Sum_{k>=0} x^(2^k), n>=1.at n=6A168365
- Hilbert series related to measurement of quantum entanglement - see Hero and Willenbring for precise definition.at n=4A176674
- Expansion of g.f. (6 + 5*x - 20*x^2 - 12*x^3 + 12*x^4 + 3*x^5)/(1 + x - 5*x^2 - 4*x^3 + 6*x^4 + 3*x^5 - x^6).at n=14A216605
- a(n) is the least value of k such that the decimal expansion of n^k contains nine consecutive identical digits.at n=21A217164
- Number of nondecreasing -2..2 vectors of length n whose dot product with some lexicographically greater or equal nondecreasing -2..2 vector equals n.at n=21A226416
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 205", based on the 5-celled von Neumann neighborhood.at n=6A270730
- Unbranched catafusenes, mirror-symmetrical.at n=21A323931
- Number of edges in a square when n internal squares are drawn between the 4n points that divide each side into n+1 equal parts.at n=42A357061