16459
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16720
- Proper Divisor Sum (Aliquot Sum)
- 261
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 16200
- Möbius Function
- 1
- Radical
- 16459
- Omega Function (Ω)
- 2
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 40
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 61 ones.at n=0A031829
- Number of true prime powers whose binary order, ceiling(log_2(p^x)), is n.at n=38A036380
- Composite numbers which in base 6 contain their largest proper factor as a substring.at n=6A063156
- Duplicate of A063156.at n=6A063876
- Numbers n such that n and n+4 are both brilliant numbers (A078972).at n=14A083285
- Composite numbers such that all divisors >1 have the same number of 1's in binary representation.at n=33A089042
- Eigenvector of the triangle of distinct partitions (A008289), so that: a(n) = Sum_{k=1..tri(n)} A008289(n,k)*a(k) for n>=1 with a(1)=1, where tri(n) = floor((sqrt(8*n+1)-1)/2).at n=50A118399
- Numbers k such that the reversal of phi(k) is sigma(k)-k.at n=6A254320
- Sum of divisors of the products of the smaller and larger parts of the partitions of n into two parts.at n=44A270528
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 534", based on the 5-celled von Neumann neighborhood.at n=38A272788
- Positive integers that have exactly nine representations of the form 1 + p1 * (1 + p2* ... * (1 + p_j)...), where [p1, ..., p_j] is a (possibly empty) list of distinct primes.at n=36A317399
- G.f. A(x) satisfies: Sum_{n>=0} A(x)^((n-1)^2) * x^n = Sum_{n>=0} (A(x)^(n-2) + 1)^n * x^n.at n=8A326563
- Indices of Ennesrem primes: k such that A004094(k)-1 is prime.at n=7A341713
- a(n) = Sum_{k=1..A003056(n)} 2^(T(n,k)-1), where T(n,k) = k-th term in row n of A235791.at n=14A348473