Properties of the Number -1158

One Hundred Fifty-Eight

Basics

Value: -1159 → -1158 → -1157

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 193

Divisors: 1, 2, 3, 6, 193, 386, 579, 1158

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10010000110

Octal: -2206

Duodecimal: -806

Hexadecimal: -486

Square: 1340964

Square Root: 34.02939905434711

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

Riordan's general Eulerian recursion: T(n, k) = (k+2)*T(n-1, k) + (n-k-1) * T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-1)^n-1. A157013

Coefficient array for square of Chebyshev S-polynomials. A181878

Expansion of ψ(q⁵)/ψ(q) in powers of q where ψ() is a Ramanujan θ function. A116494

Expansion of (φ(q) / φ(q³) - 1) / 2 in powers of q where φ() is a Ramanujan θ function. A139139

Triangle read by rows, T(n, k) the coefficients of some polynomials in π, for n >= 0 and 0 <= k <= n. A295516

Number of compositions of n whose run-lengths are all different. A329739

Number of points on surface of octahedron; also coordination sequence for cubic lattice: a(0) = 1; for n > 0, a(n) = 4n² + 2. A5899

a(n) = n² + 2. A59100

Triangular array T read by rows: T(n,0)=T(n,n)=1 for n >= 0; for n >= 2 and 1 <= k <= n-1, T(n,k) = T(n-1,k-1) + T(n-2,k-1) + T(n-1,k) if 1 <= k <= floor(n/2), else T(n,k) = T(n-1,k-1) + T(n-1,k). A26780

Numbers m such that the Bernoulli number B_m has denominator 42. A51228