16389
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24320
- Proper Divisor Sum (Aliquot Sum)
- 7931
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10908
- Möbius Function
- 0
- Radical
- 1821
- Omega Function (Ω)
- 4
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 115
- 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
- Numbers that are the sum of 6 positive 7th powers.at n=28A003373
- Smallest number > 1 equal to sum of n-th powers of its base-3 digits, or 0 if no such number exists (written in base 10).at n=13A033835
- Sums of 3 distinct powers of 4.at n=35A038471
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.at n=38A050027
- a(n) = n*(6*n^2 - 7*n + 3)/2.at n=18A071230
- a(1) = 11; a(n) = if n == 2 mod 3 then a(n-1)-3, if n == 0 mod 3 then a(n-1)-2, if n == 1 mod 3 then a(n-1)*2.at n=44A085688
- A106486-encodings of combinatorial games with value 2.at n=17A125995
- Numbers a(n) are obtained by the direct application of sieve of Eratosthenes for A000695: retaining A000695(2)=4, we delete all multiples of 4, which are more than 4; retaining A000695(3)=5, we delete all multiples of 5, which are more than 5, etc.at n=41A152021
- Base-3 perfect digital invariants (written in base 10): numbers equal to the sum of the k-th powers of their base-3 digits, for some k.at n=26A162216
- a(n) = 2^n + 5.at n=14A168614
- Sums of three Mersenne primes.at n=31A174055
- Expansion of (1-x)*(1-2x)/((1-5x+5*x^2)*(1-3x+x^2)).at n=7A217783
- Numbers of the form 4^j + 5^k, for j and k >= 0.at n=48A226810
- T(n,k)=Number of length n+4 0..k arrays with no consecutive five elements summing to more than 2*k.at n=28A241936
- Number of length 1+4 0..n arrays with no consecutive five elements summing to more than 2*n.at n=7A241937
- a(n) = 4*n^3 + 5.at n=17A243762
- Number of length n+2 0..4 arrays with every three consecutive terms having the sum of some two elements equal to twice the third.at n=14A248429
- Sums of Pythagorean sextuples in increasing order: The sums of sets of six natural numbers which correspond to the lengths of the edges of a tetrahedron whose four faces are all different Pythagorean triangles.at n=27A248548
- Numbers a(n) which are the minimum number of moves needed in a variation of the tower of Hanoi with 4 towers and n disks.at n=15A248604
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 555", based on the 5-celled von Neumann neighborhood.at n=24A272922