Properties of the Number -32759

Thirty-Two Thousand Seven Hundred Fifty-Nine

Basics

Value: -32760 → -32759 → -32758

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 17 × 41 × 47

Divisors: 1, 17, 41, 47, 697, 799, 1927, 32759

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111111111110111

Octal: -77767

Duodecimal: -16B5B

Hexadecimal: -7ff7

Square: 1073152081

Square Root: 180.99447505379825

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

The r-th term of the n-th row of the following array contains the sum of r successively decreasing integers beginning from n. 0 < r <= n. Sequence contains the leading diagonal. A110427

Number of atoms in a decahedron with n shells. A4068

a(n) = n⁵ - n - 1. A126426

a(n) = 2ⁿ - 9. A185346

Number of 5-almost primes 5ap such that 2ⁿ < 5ap <= 2ⁿ⁺¹. A120036

Lucas pseudoprimes. A217120

Frobenius number of the numerical semigroup generated by consecutive squares. A69756

a(n) = prime(n)*prime(n+1) + prime(n) + prime(n+1). A126199

a(1)=1. a(n) = the smallest integer > a(n-1) such that d(a(n))+d(a(n)+1) > d(a(n-1))+d(a(n-1)+1), where d(m) = the number of divisors of m. A175143

Monotonic ordering of nonnegative differences 2ⁱ-9^j, for 40>=i>=0, j>=0. A192122