Properties of the Number -32809

Thirty-Two Thousand Eight Hundred Nine

Basics

Value: -32810 → -32809 → -32808

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 7 × 43 × 109

Divisors: 1, 7, 43, 109, 301, 763, 4687, 32809

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1000000000101001

Octal: -100051

Duodecimal: -16BA1

Hexadecimal: -8029

Square: 1076430481

Square Root: 181.13254815189896

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 that are the sum of 9 nonzero 8th powers. A3387

Triangle read by rows in which row n lists n terms, starting with n⁴ + n - 1, such that the difference between successive terms is equal to n⁴ - 1 = A123865(n). A162624

Triangle read by rows in which row n lists n terms, starting with n, such that the difference between successive terms is equal to n⁴ - 1 = A123865(n). A162623

Numbers of the form prime(w)*prime(x)*prime(y) with w >= x >= y such that 2w = 3x + 4y. A358102

a(n) = 2ⁿ⁺¹ - 1 + 3·n. A131833

a(0) = 1, a(1) = 3; a(n+2) = (a(n+1) + a(n))/2 if 2 divides (a(n+1) + a(n)), a(n+2) = a(n+1) + a(n) otherwise. A151749

Having specified two initial terms, the "Half-Fibonacci" sequence proceeds like the Fibonacci sequence, except that the terms are halved before being added if they are even. A120424

Square array read by ascending antidiagonals, T(n, k) = k!*[x^k](exp(x)*sum(j=0..n, C(2·n,j)*x^j)), n>=0, k>=0. A253670