Properties of the Number -53159

Fifty-Three Thousand One Hundred Fifty-Nine

Basics

Value: -53160 → -53159 → -53158

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 17 × 53 × 59

Divisors: 1, 17, 53, 59, 901, 1003, 3127, 53159

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1100111110100111

Octal: -147647

Duodecimal: -2691B

Hexadecimal: -cfa7

Square: 2825879281

Square Root: 230.56235599073844

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

Composite numbers k such that k is a substring of A067599(k). A390475

Number of partitions of 0 of the form [x(1)+x(2)+...+x (j)] - [y(1)+y(2)+...+y(k)] where the x(i) are distinct positive integers <=n and the y(i) are distinct positive integers <= n. A209535

In the lexicographically ordered table of permutations of [n], there are two entries that give the greatest sum of pairwise products and they are reversals of each other. The items in this sequence are the indices of the earlier of the two. A102417

a(n) = (n² + 1) * (2·n - 1). A290631

Number of n X 5 0..1 arrays with every element equal to 0, 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A299876

Number of nX7 0..1 arrays with every element equal to 0, 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A299878