Properties of the Number -16838

Sixteen Thousand Eight Hundred Thirty-Eight

Basics

Value: -16839 → -16838 → -16837

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 × 8419

Divisors: 1, 2, 8419, 16838

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -100000111000110

Octal: -40706

Duodecimal: -98B2

Hexadecimal: -41c6

Square: 283518244

Square Root: 129.76131935210893

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

a(n) = 7ⁿ + 2ⁿ - 1. A155590

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250729

Pseudo-random numbers: a (very weak) pseudo-random number generator from the second edition of the C book. A61364

Expansion of ∏_n>=1 ((1 - (2·x)ⁿ)/(1 + (2·x)ⁿ))^1/2. A303306

a(n) = 2*(n³ + n² + n - 1). A155120

Number of canonical 3-polytopes of size n. A319959

Numbers k such that σ(k) mod π(k) = 1. A73723

Number of partitions of n with difference 1 between the number of odd parts and the number of even parts, both counted without multiplicity. A242692

Number of (2+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250731

Number of (3+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction. A250758