14382
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
- 24
- Divisor Sum
- 33696
- Proper Divisor Sum (Aliquot Sum)
- 19314
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4416
- Möbius Function
- 0
- Radical
- 4794
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 71
- 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
- a(n) = A000217(A000217(n))-n^2.at n=18A086602
- Numbers m such that m is k*(the sum of decimal digits squared of m), k=153 case.at n=3A117810
- a(n) = 729*n - 198.at n=19A156772
- Number of ways of making change for n cents using coins whose values are the previous terms in the sequence, starting with 1,2 cents.at n=57A267419
- Positive even numbers which are neither of the form p + 2^m + 1 nor of the form p + 2^m - 1 with p prime.at n=19A270446
- Expansion of Product_{i>=1, j>=0} (1 + x^(i * 3^j)).at n=45A327726
- Numbers k such that k and k+2 are both primitive practical numbers (A267124).at n=38A334882
- Numbers k such that k and k+1 are both divisible by the total binary weight of their divisors (A093653).at n=6A338514
- a(n) = Sum_{k=1..floor(n/2)} k * (n-k) * floor((n-k)/k).at n=38A339804