Properties of the Number 16865

Sixteen Thousand Eight Hundred Sixty-Five

Basics

Value: 16864 → 16865 → 16866

Parity: odd

Prime: No

Previous Prime: 16843

Next Prime: 16871

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 5 × 3373

Divisors: 1, 5, 3373, 16865

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100000111100001

Octal: 40741

Duodecimal: 9915

Hexadecimal: 41e1

Square: 284428225

Square Root: 129.86531484580476

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

Numbers k such that k² is palindromic in base 4. A29986

Numbers n such that A242719(n) = (prime(n))²+1 and A242720(n) - A242719(n) = 2*(prime(n)+1). A246748

Triangle T(n,k) giving the number of simple matroids of rank k on n labeled points (n >= 2, 2 <= k <= n). A58720

a(n) = floor(c·s*a(n-1)) + floor(d·r*a(n-2)), where r = (1+sqrt(5))/2, s = r/(r-1), c = 1, d = 1, a(0) = 1, a(1) = 2. A275857

a(1) = 1, then add, subtract and multiply 2, 3, 4; 5, 6, 7; ... in that order. A362271

G.f. satisfies: A(x) = (1+x+x²) * A(x²)². A237651

a(n) = ∑_i=0..n digsum₉(i)³, where digsum₉(i) = A053830(i). A231686

Triangle read by rows: T(n,k) = number of rooted signed trees with n nodes and k positive edges (0 <= k < n). A304489

Gaps of 9 in sequence A038593 (upper terms). A38658

G.f.: A(x) = exp( ∑_n>=1 5·5^A112765(n) * xⁿ/n ), where A112765 is the exponent of the highest power of 5 dividing n. A195760