14115
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22608
- Proper Divisor Sum (Aliquot Sum)
- 8493
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7520
- Möbius Function
- -1
- Radical
- 14115
- Omega Function (Ω)
- 3
- 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
- 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
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 39.at n=39A031537
- Numbers whose set of base-8 digits is {3,4}.at n=36A032832
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1100-1111-1000 pattern in any orientation.at n=10A146715
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, 0, 1), (1, -1, 1), (1, 0, -1), (1, 1, 1)}.at n=7A150872
- Numbers k such that A(k+1) = A(k) + 1, where A() = A005101() are the abundant numbers.at n=11A169822
- Number of n-step three-sided prudent self-avoiding walks ending on the top side of their box.at n=10A191824
- Self-composition of the pentagonal numbers; g.f.: A(x) = G(G(x)), where G(x) = g.f. of A000326.at n=6A279284
- Numbers k such that (5*10^k - 473)/9 is prime.at n=17A295969
- a(n) is the smallest positive integer which can be represented as the sum of n distinct nonzero tetrahedral numbers in exactly n ways, or -1 if no such integer exists.at n=19A360217
- Number of partitions of n into distinct parts where there are k^2-1 kinds of part k.at n=12A363599
- Number of non-derangements of length n with 2 excedances.at n=6A385588