14427
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23920
- Proper Divisor Sum (Aliquot Sum)
- 9493
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8208
- Möbius Function
- 0
- Radical
- 4809
- 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
- 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
- Numerators of continued fraction convergents to sqrt(406).at n=6A041770
- An approximation to sigma_{5/2}(n): ceiling( sum_{d|n} d^(5/2) ).at n=41A058274
- Trajectory of 537 under the Reverse and Add! operation carried out in base 2, written in base 10.at n=6A077076
- Number of partitions of n in which number of least parts is equal to least part.at n=44A096403
- Numbers k such that 21^k - 2 is a prime.at n=19A128461
- Numbers n such that sigma(sigma(phi(n))) = sigma(sigma(n)).at n=24A172466
- Number of 2 X 2 matrices M with all terms in {1,...,n} and permanent(M) >= n.at n=11A212240
- Total sum of parts of multiplicity 4 in all partitions of n.at n=34A222732
- Number of ways of writing n as the sum of 7 triangular numbers.at n=38A226252
- Sum of the prime parts in the partitions of n into 5 parts.at n=39A309466
- Number of different values of x_1*x_2*...*x_n where x_1=1 and x_i-x_{i-1} is 0 or 1.at n=17A334635
- G.f. A(x) satisfies A(x)^2 = A( x^2 + 2*x*A(x)^2 + 2*A(x)^4 ).at n=8A378247
- a(n) = (1/4) * Sum_{k=0..floor(n/3)} (n-2*k+2) * binomial(2*n-4*k+2,2*k+1).at n=11A391831