14084
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
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 28224
- Proper Divisor Sum (Aliquot Sum)
- 14140
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 6024
- Möbius Function
- 0
- Radical
- 7042
- Omega Function (Ω)
- 4
- 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
- 107
- 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
- Denominators of continued fraction for alternating factorial.at n=12A056922
- a(1) = 1, a(n+1) = a(n) + n*(a(1) + a(2) + ... + a(n)).at n=6A093935
- a(n) = Sum_{k=0..floor(n/2)} lcm(1,...,2*(n-k)+2)/lcm(1,...,2*k+2).at n=5A120107
- Numbers k such that A119682(k) is prime.at n=43A136682
- Number of compositions of n such that the greatest part is divisible by the number of parts.at n=19A171632
- Number n such that the sum of its proper evil divisors (A001969) equals n.at n=23A230587
- a(0) = -1; for n > 0, number of indecomposable derangements, i.e., no fixed points, and not fixing [1..j] for any 1 <= j < n.at n=8A259869
- Triangle read by rows, T(n,k) = Sum_{j=0..n} (-1)^(n-j)*C(-j,-n)*S1(j,k), S1 the Stirling cycle numbers A132393, for n>=0 and 0<=k<=n.at n=40A269951
- Number of 5 X n 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=9A281209
- Difference between maximum and minimum sum of products of successive pairs in permutations of [n].at n=43A306262
- Expansion of e.g.f. -log(1-x)^3 * exp(x) / (6 * (1-x)).at n=7A381025
- a(n) = 4*(23 - 17*n + 8*n^2).at n=21A387458
- Let P(m,k) = 1-(m-1)*...*(m-k+1)/m^(k-1) be the probability that at least two out of k people share a birthday out of m possible days. Sequence gives values of m for which P(m,k(m)) sets a new maximum, where k(m) = A033810(m)-1 is the largest k such that P(m,k) < 1/2.at n=8A392223