Properties of the Number -115

One Hundred Fifteen

Basics

Value: -116 → -115 → -114

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 7

Digital Root: 7

Palindrome: No

Factorization: 5 × 23

Divisors: 1, 5, 23, 115

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: -1110011

Octal: -163

Duodecimal: -97

Hexadecimal: -73

Square: 13225

Square Root: 10.723805294763608

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

Signed denominators of Leibniz series for π/4. A157142

Deficiency computed for conjugated prime factorization: a(n) = A033879(A122111(n)). A323174

5th differences of partition numbers A000041. A81095

Triangle read by rows: T(0,0)=1; for n >= 1 T(n,k) is the coefficient of x^k in the monic characteristic polynomial of the tridiagonal n X n matrix with main diagonal 5,5,5,... and sub- and superdiagonals 1,1,1,... (0 <= k <= n). A123967

Expansion of ∏_n>=1 (1-xⁿ)⁵. A728

Expansion of (1-x-x^N)/((1-x)(1-x²)(1-x³)...(1-x^N)) for N = 4. A60023

Triangle T, read by rows, equal to the matrix product T = H*[C^-1]*H, where H is the self-inverse triangle A118433 and C is Pascal's triangle. A118435

Triangle T(n, k, m) = t(n, m)/(t(k, m)*t(n-k, m)), where t(n, k) = ∏_j=1..n p(j, k+1), p(n, x) = ∑_j=0..n (-1)^j*A053122(n, j)*x^j, and m = 6, read by rows. A156600

G.f.: Im(1/(i·x; x)_inf), where (a; q)_inf is the q-Pochhammer symbol, i = sqrt(-1). A292137

The y-coordinates of the vertices of the Babylonian Wurm. A342623