14202
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 31680
- Proper Divisor Sum (Aliquot Sum)
- 17478
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4716
- Möbius Function
- 0
- Radical
- 1578
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 89
- 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
- tanh(arctan(x)*arcsin(x))=2/2!*x^2-4/4!*x^4-82/6!*x^6+3096/8!*x^8...at n=4A012439
- Numbers k such that k^2 and k^3 have the same set of digits.at n=21A029797
- Numbers d_n used in recurrence for series-parallel numbers.at n=17A036655
- Starting positions of strings of 3 0's in the decimal expansion of Pi.at n=10A050202
- Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below.at n=22A078612
- a(n) = Sum_{k=0..floor(n/3)} binomial(2*n-3*k, n).at n=8A105872
- Triangular array formed by the little Schröder numbers s(n,k).at n=50A110440
- The difference between the largest part and the smallest part summed over all those partitions of n in which every integer from the smallest part to the largest part occurs.at n=47A117471
- Numbers k for which 14*k+1, 14*k+5, 14*k+11 and 14*k+13 are primes.at n=41A123987
- Values of m such that A139361(n)=4m+1.at n=30A139362
- a(n) = Sum of all numbers of divisors of all numbers < (n+1)^2.at n=41A168011
- Number of partitions of n such that neither floor(n/2) nor ceiling(n/2) is a part.at n=34A238623
- a(n) = (3/n^3) * Sum_{d|n} (-1)^(n+d)*moebius(n/d)*binomial(2*d,d).at n=12A254593
- Number of nX5 0..1 arrays with every element unequal to 0, 1, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=11A318347
- Iteration of Abelian sandpile model where the n-th matrix expansions occurs. Begins with infinite sand in 1 X 1 matrix.at n=48A328506
- a(n) = Sum_{i=0..floor(q(n)/3)} binomial(n-3*(i+1), q(n)-3*i) with q(n) = ceiling((n-3)/2).at n=16A366107
- Number of integer partitions of n whose multiset multiplicity kernel is a submultiset.at n=45A367684