14048
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
- 27720
- Proper Divisor Sum (Aliquot Sum)
- 13672
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7008
- Möbius Function
- 0
- Radical
- 878
- Omega Function (Ω)
- 6
- 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
- Number of graphical partitions of 2n.at n=19A000569
- Number of triples {i,j,k}, i>1, j>1, k>1, such that i*j*k < n^3.at n=14A037092
- McKay-Thompson series of class 38A for Monster.at n=46A058657
- Let g be a permutation of [1..n] having say j_i cycles of length i, with Sum_i i*j_i = n; sequence gives Sum_g Sum_{i odd} (j_i)^2.at n=6A151884
- (A178476(n)-3)/9.at n=20A178486
- G.f. satisfies A(x) = exp( Sum_{n>=1} 2^n*A(x^n)*x^n/n ).at n=7A179469
- Riordan array ((1-x)/(1-2*x-x^2), x*(1+x)/(1-2*x-x^2)).at n=47A210636
- Number of length 3+1 0..2*n arrays with the sum of the absolute values of adjacent differences equal to 3*n.at n=14A249983
- Number of length n arrays of permutations of 0..n-1 with each element moved by -4 to 4 places and every three consecutive elements having its maximum within 4 of its minimum.at n=12A263699
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 305", based on the 5-celled von Neumann neighborhood.at n=6A271161
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 421", based on the 5-celled von Neumann neighborhood.at n=6A272050
- Number of compositions of n if only the order of the odd numbers matter.at n=20A275548
- Number of minimal dominating sets in the 2 X n king graph.at n=14A286850
- a(1) = 1; a(n) = Sum_{k=1..n} a(ceiling((n-1)/k)).at n=37A290845
- Number of necklaces with n black and n white beads that avoid the pattern BBBB.at n=10A351364
- Number of integer partitions of n whose maximal anti-runs have distinct maxima.at n=47A375133