14198
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22080
- Proper Divisor Sum (Aliquot Sum)
- 7882
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6840
- Möbius Function
- -1
- Radical
- 14198
- 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
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- a(0) = 1, a(n) = 21*n^2 + 2 for n>0.at n=26A010011
- Number of positive integers <= 2^n of form 4 x^2 + 5 y^2.at n=17A054169
- Number of basis partitions (or basic partitions) of n.at n=52A066447
- Quintisection of 1/(1-x^5-x^6).at n=18A099132
- Binomial transform of the expansion of 1/(1-x^5-x^6).at n=15A107025
- Number of partitions of n into at least two parts such that the product of largest and smallest part does not exceed n.at n=35A116901
- a(n) = 4^n - 3^n + 1.at n=7A155609
- Number of nondecreasing arrangements of n+2 numbers in 0..4 with each number being the sum mod 5 of two others.at n=19A183907
- Number of nondecreasing arrangements of 7 numbers x(i) in -(n+5)..(n+5) with the sum of sign(x(i))*x(i)^2 zero.at n=9A188007
- Positive integers m with 2^(m-1)*phi(m) - 1 prime, where phi(.) is Euler's totient function.at n=28A236375
- Self-convolution of Sum(binomial(2*n, i), i=0..n).at n=6A240879
- Number of partitions of n such that (number parts having multiplicity 1) is a part and (number of parts > 1) is not a part.at n=39A241513
- Number of maximal independent vertex sets (and minimal vertex covers) in the n-wheel graph.at n=31A290612
- a(n) = 110*2^n + 118.at n=7A305063
- T(n, k) = binomial(2*n - 1 - k, k - 1)*hypergeom([2, 2, 1-k], [1, 1 - 2*k + 2*n], -1), triangle read by rows, T(n, k) for n >= 1 and 1 <= k <= n.at n=51A320905
- Number of maximal independent vertex sets and minimal vertex covers in the n-trapezohedral graph.at n=16A367644
- a(n) = k is the largest k for which k^5 is n digits long and the sum of digits of k^5 is the maximum for any n digit 5th power (A374025).at n=20A380566
- a(n) = 3^n * n! * binomial(5*n/3,n) * Sum_{k=1..n} 1/(2*n+3*k).at n=3A384170
- a(n) = Sum_{k=0..floor(2*n/5)} binomial(k,2*n-5*k).at n=45A391265
- a(n) = Sum_{k=0..floor(3*n/5)} binomial(k,3*n-5*k).at n=30A392271