16415
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23256
- Proper Divisor Sum (Aliquot Sum)
- 6841
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11088
- Möbius Function
- 0
- Radical
- 2345
- 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
- 84
- 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
- Multiplicity of highest weight (or singular) vectors associated with character chi_49 of Monster module.at n=41A034437
- Numbers k such that 267*2^k + 1 is prime.at n=32A053350
- Numbers k such that A055079(k) = 2^k.at n=35A057838
- floor[2^n/Fibonacci(n)].at n=41A057861
- a(n) is the minimal area of a convex lattice polygon with 2n sides.at n=47A089187
- a(n) = n^5 - n^3 - n^2.at n=7A133070
- p^5 - p^3 - p^2. Exponents are the prime numbers in decreasing order and p is the n-th prime.at n=3A135179
- Triangle T(n, k, m) = coefficients of p(x, n, m) where p(x,n,m) = (x+1)*p(x, n-1, m) + 2^(m+n-1) *x*p(x, n-2, m) and m=0, read by rows.at n=31A154982
- Triangle T(n, k, m) = coefficients of p(x, n, m) where p(x,n,m) = (x+1)*p(x, n-1, m) + 2^(m+n-1) *x*p(x, n-2, m) and m=0, read by rows.at n=32A154982
- a(n) = smallest number that leads to a new fixed point under the base-2 Kaprekar map of A164884.at n=41A164887
- Numbers n such that sum of squares of digits of n equals the sum of prime divisors of n.at n=34A217390
- Triangular array read by rows. T(n,k) is the number of labeled relations on n elements with exactly k vertices of indegree and outdegree = 0.at n=32A217436
- Composites whose prime factorization in base 3 is an anagram of the number in base 3.at n=30A260047
- a(n) is the greatest nonnegative number which has a partition into a triangular number (A000217), a square number (A000290), and a pentagonal number (A000326) in n different ways.at n=48A327792
- Number of twice-partitions of n into partitions of distinct lengths and distinct sums.at n=18A358832
- Least number m such that denominator(sigma(m)/(m+1)) = n, or zero if no such m exists.at n=11A359625
- Numbers k such that A163511(k) is a fifth power.at n=27A365802
- a(n) is the number of n-digit numbers whose difference between the largest and smallest digits is equal to 6.at n=4A367247
- Expansion of 1/((1-x) * (1-13*x))^(5/2).at n=3A387315