Properties of the Number -1159

One Hundred Fifty-Nine

Basics

Value: -1160 → -1159 → -1158

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 19 × 61

Divisors: 1, 19, 61, 1159

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10010000111

Octal: -2207

Duodecimal: -807

Hexadecimal: -487

Square: 1343281

Square Root: 34.044089061098404

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

Antidiagonal-sums of the array A377051(n,k) = n-th term of k-th differences of powers of primes. A377052

a(n) = 3·a(n-2) - a(n-1) for n > 1, a(0) = 0, a(1) = 1. A182228

Deficiency of squares: a(n) = 2n² - σ(n²). A377879

exp(arctan(arcsin(x)))=1+x+1/2!*x²-3/4!*x⁴+4/5!*x⁵+69/6!*x⁶... A12194

cosh(arctan(arcsin(x)))=1+1/2!*x²-3/4!*x⁴+69/6!*x⁶-1159/8!*x⁸... A12201

Number of independent polynomial invariants of matrix of order n. A7718

Centered octahedral numbers (crystal ball sequence for cubic lattice). A1845

a(n) = C(n,1) + C(n,2) + C(n,3), or n*(n² + 5)/6. A4006

a(n) = a(n-1) + 3·a(n-2) for n > 1, a(0) = a(1) = 1. A6130

Mian-Chowla sequence (a B₂ sequence): a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the pairwise sums of elements are all distinct. A5282