Properties of the Number -53134

Fifty-Three Thousand One Hundred Thirty-Four

Basics

Value: -53135 → -53134 → -53133

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 31 × 857

Divisors: 1, 2, 31, 62, 857, 1714, 26567, 53134

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1100111110001110

Octal: -147616

Duodecimal: -268BA

Hexadecimal: -cf8e

Square: 2823221956

Square Root: 230.50813434670803

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

Number of forests of rooted trees with total weight n, where a node at height k has weight 2^k (with root considered to be at height 0). A115593

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 8 king-move adjacent elements, with upper left element zero. A316183

a(n) = a(n-1) + floor(a(n-2)/2) with a(0)=1, a(1)=2. A64324

a(n) = 3·Fibonacci(2·n) + 1. A97136

n times n+2 gives the concatenation of two numbers m and m-9. A116226

a(n) = 3·Fibonacci(n) + (-1)ⁿ. A97133

a(0)=1, a(1)=4, a(n) = a(n-1) + a(n-2) - 1. A187893

a(n) = ∑_k=0..n Fibonacci(k) + (-1)^k*Fibonacci(k-1). A97132

a(n) = 2·prime(n)² - 4. A153480

Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 8 king-move adjacent elements, with upper left element zero. A316178