Properties of the Number 16565

Sixteen Thousand Five Hundred Sixty-Five

Basics

Value: 16564 → 16565 → 16566

Parity: odd

Prime: No

Previous Prime: 16561

Next Prime: 16567

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 5 × 3313

Divisors: 1, 5, 3313, 16565

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 100000010110101

Octal: 40265

Duodecimal: 9705

Hexadecimal: 40b5

Square: 274399225

Square Root: 128.70508925446578

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Expansion of (2 + 2·x - 3·x²) / (1 - 2·x - x² + x³). A33304

Sum of n-th powers of the three roots of x³-2·x²-x+1. A274975

a(n) = 7ⁿ - 3ⁿ + 1. A155612

One of the two successive approximations up to 2ⁿ for 2-adic integer sqrt(-7). This is the 1 (mod 4) case. A318960

a(n) = 10·n² - 6·n + 1. A87348

Sum of n-th powers of the roots of x³ + 11·x² - 4·x - 1. A274664

G.f.: 1/(1 - x·d/dx log(η(x))), where η(x) is Dedekind's η(q) function without the q^1/24 factor. A283334

1/3 of the number of permutations of 2 indistinguishable copies of 1..n with exactly 4 local maxima. A152496

Semiprime numbers whose digit string can be partitioned into three parts such that the product of the first two parts equals the third part. A280636

Total number of nodes summed over all lattice paths from (0,0) to (i,n-2·i) that do not go above the diagonal x=y using steps in {(1,0), (0,1)}. A357655