14679
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 24336
- Proper Divisor Sum (Aliquot Sum)
- 9657
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8352
- Möbius Function
- 0
- Radical
- 4893
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 195
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers m not of the form k*(k+2) that have a single '1' in the periodic part of the continued fraction of sqrt(n).at n=42A102538
- Sum of parts, counted without multiplicities, in all partitions of n into odd parts.at n=35A116930
- Numbers n such that n^6 + 272 is prime.at n=18A161998
- a(n) = 8*a(n-1) - 13*a(n-2) for n > 1; a(0) = 3, a(1) = 15.at n=5A163470
- n!, digits ordered, zeros omitted.at n=12A181952
- Floor(M(g(n-1)+1,..,g(n))), where M = harmonic mean and g(n) = n(n + 1)(n + 2)/6.at n=43A227016
- Number of partitions of n such that (maximal multiplicity of parts) = (multiplicity of the least part).at n=37A240303
- a(n) = floor(4^n/(2+2*cos(2*Pi/7))^n).at n=46A240671
- Number of ways to place 3n rooks on an n X n board, 3 rooks in each row and each column, multiple rooks in an allowed cell, and exactly 4 rooks below the main diagonal.at n=2A260583
- Triangle of generalized Eulerian numbers T(n,k) = <n,k>_3 read by rows, n >= 1, 0 <= k <= 3*(n-1).at n=26A269743
- Triangle of generalized Eulerian numbers T(n,k) = <n,k>_3 read by rows, n >= 1, 0 <= k <= 3*(n-1).at n=30A269743
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 291", based on the 5-celled von Neumann neighborhood.at n=27A271131
- G.f. A(x) satisfies: A(x) = Sum_{n>=0} binomial( n*(n+1)/2, n) * x^n / A(x)^( n*(n+1)/2 ).at n=6A298690