Properties of the Number -5895

Eight Hundred Ninety-Five

Basics

Value: -5896 → -5895 → -5894

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 131

Divisors: 1, 3, 5, 9, 15, 45, 131, 393, 655, 1179

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1011100000111

Octal: -13407

Duodecimal: -34B3

Hexadecimal: -1707

Square: 34751025

Square Root: 76.77890335241837

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

Expansion of g.f. A(x) satisfying A( x*(1 + 2·x)*A(x) )³ = A( x²*(1 + 3·x)*A(x) )². A370437

Triangle T(n,k) read by rows, giving number of bracelets (turnover necklaces) with n beads of k colors (n >= 1, 1 <= k <= n). A81720

Triangle T, read by rows, equal to a diagonal bisection of A118032 such that diagonal n of T equals diagonal 2n+1 of A118032: T(n,k) = A118032(2n+1-k,k); also equals the matrix product of A118032 and SHIFT_UP(A118032). A118045

Expansion of 1/((1-x)*(1-x-x³)). A77868

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 1 0 1 vertically. A208028

Numbers n such that A003313(n) = A003313(2n). A86878

Number of integer partitions of n having more than one permutation with all equal run-lengths. A383090

a(n) = 2·a(n-1) + 13·a(n-2), for n>1, a(0)=1, a(1)=1. A133343

Numbers that are the sum of five third powers in seven or more ways. A345180

Number of bracelets (turnover necklaces) with n beads of 5 colors. A32276