16775
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 23064
- Proper Divisor Sum (Aliquot Sum)
- 6289
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12000
- Möbius Function
- 0
- Radical
- 3355
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 66
- 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
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 3).at n=48A035538
- Consider all integer triples (i,j,k), j >= k > 0, with i^3 = binomial(j+2,3) + binomial(k+2,3), ordered by increasing i; sequence gives i values.at n=16A054208
- Number of ways to color vertices of a pentagon using <= n colors, allowing rotations and reflections.at n=11A060446
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 9 (most significant digit on right).at n=8A061938
- Integer part of log(n!)^(1 + log(1 + log(n))).at n=24A062443
- Nearest integer to log(n!)^(1 + log(1 + log(n))).at n=24A062444
- Numbers n for which there are exactly twelve k such that n = k + reverse(k).at n=12A072435
- Denominators of continued fraction convergents to sinh(1).at n=10A078981
- Numbers expressible as the difference of two nonnegative fifth powers.at n=27A152045
- Triangle read by rows: For 1 <= m <= n, t(n,m) = the smallest positive integer that when read in binary contains exactly (n+1-m) runs of 0's and 1's, all runs being of distinct lengths m through n in any order within binary t(n,m).at n=10A161000
- Least integer, k, whose value is n in A165413.at n=4A165933
- A positive integer n is included if n, when written in binary, is made of run-lengths (lengths of runs of 0's as well as of runs of 1's) that form a permutation of some number of consecutive positive integers starting with 1.at n=33A175061
- Difference of two positive 5th powers.at n=21A181124
- Total Wiener index of double-star trees with n nodes.at n=28A186235
- a(n) = 7^n - 2^n.at n=5A190540
- Monotonic ordering of nonnegative differences 7^i-2^j, for 40>=i>=0, j>=0.at n=40A192119
- Number of Dyck paths of semilength n such that no level has more than seven peaks.at n=10A287971
- Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = Sum_{d|n} d*sigma_k(d).at n=48A322104
- Column 2 of triangle in A288180.at n=12A333281
- Square array T(n,k), n >= 1, k >= 1, read by antidiagonals downwards, where T(n,k) = Sum_{j=1..n} (-1)^(j+1) * floor(n/(2*j-1))^k.at n=61A350161