ℕ atory
Play Now

Properties of the Number -16851

Sixteen Thousand Eight Hundred Fifty-One

Basics

Value: -16852 → -16851 → -16850

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 41 × 137

Divisors: 1, 3, 41, 123, 137, 411, 5617, 16851

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100000111010011

Octal: -40723

Duodecimal: -9903

Hexadecimal: -41d3

Square: 283956201

Square Root: 129.81140165640304

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

Total number of parts in all partitions of n. Also, sum of largest parts of all partitions of n. A6128
a(n) = ∑k=1..n μ(k)*k3. A336277
a(n) = 10·n2+n. A55437
a(n) = 33·2n - 45 (n>=1). A304514
Odd composite integers m such that A006190(3·m-J(m,13)) == 3 (mod m), where J(m,13) is the Jacobi symbol. A340236
Denominator of the mean of all parts of all partitions of n. A236361
Number of integer partitions of n with origin-to-boundary graph-distance equal to 4. A384562
Numbers k such that 219·2k+1 is prime. A32486
a(n) = (10·n+3)*(10·n+17). A152579
The number of reachable states in a simple two-player counting game, in which each player starts with the pair (1,1) and one move is to add one of the opponent's numbers to one of your own numbers, but no number can grow above a pre-defined maximum n. The game continues until one of the players has no legal moves left. The winner is the one having the higher sum of his numbers. A161531