Properties of the Number -16832

Sixteen Thousand Eight Hundred Thirty-Two

Basics

Value: -16833 → -16832 → -16831

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁶ × 263

Divisors: 1, 2, 4, 8, 16, 32, 64, 263, 526, 1052

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100000111000000

Octal: -40700

Duodecimal: -98A8

Hexadecimal: -41c0

Square: 283316224

Square Root: 129.73819792181484

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 e.g.f. exp(x + tanh(x)). A9285

a(n) = a(n-1)+a(m), where m=2n-2-2^p+1 and 2^p<n-1<=2^p+1, for n >= 4. A50071

Array read by antidiagonals: T(m,n) = number of Eulerian cycles in the torus grid graph C_m X C_n. A298117

Total number of parts coprime to n in the partitions of n into 8 parts. A363326

Expansion of g.f. A(x) = ∑_n=-oo..+oo xⁿ * (2 + xⁿ)^2·n. A363558

Triangular array: the fission of ((x+2)ⁿ) by (q(n,x)) given by q(n,x)=xⁿ+x^n-1+...+x+1. A193850

Mirror of the triangle A193850. A193851

Triangle T(n,m) of the coefficients JacobiNC(x,y) = ∑_n>0 ∑_m=0..n-1 (-1)^m* T(n,m) *x^2·n *y^2·m/(2·n)!. A181613

a(n) is the smallest number which can be represented as the sum of n distinct n-almost primes in exactly n ways, or -1 if no such number exists. A365494

Numbers of the form 5^j + 7^k, for j and k >= 0. A226818