Properties of the Number -16957

Sixteen Thousand Nine Hundred Fifty-Seven

Basics

Value: -16958 → -16957 → -16956

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 31 × 547

Divisors: 1, 31, 547, 16957

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100001000111101

Octal: -41075

Duodecimal: -9991

Hexadecimal: -423d

Square: 287539849

Square Root: 130.21904622596497

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

Fibonacci sequence beginning 1, 10. A22100

a(n) is the least integer k > 2 such that the remainder of -k modulo p is strictly increasing over the first n primes. A306612

a(n) = ∑_i=0..n digsum₅(i)⁴, where digsum₅(i) = A053824(i). A231671

Number of partitions of n into Fibonacci number of integer parts. A102848

Number of ordered pairs of nonzero vectors over the subspaces of GF(2)ⁿ. A289542

Semiprimes generated by the polynomial 2·n² + 29. A241554

Number of partitions p of n such that (number of odd numbers in p) is a part of p. A241545

Positive integers·such that x³ - 1 = y⁴ + z² for some positive integers y and z. A266215

Composite numbers of the form 2·k² + 29. A352949

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (1, 0, 0), (1, 0, 1), (1, 1, -1)}. A150113