Properties of the Number -128

One Hundred Twenty-Eight

Basics

Value: -129 → -128 → -127

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ⁷

Divisors: 1, 2, 4, 8, 16, 32, 64, 128

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: -10000000

Octal: -200

Duodecimal: -A8

Hexadecimal: -80

Square: 16384

Square Root: 11.313708498984761

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: Yes

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 e.g.f. sin(x)*exp(x). A9545

Triangle T, read by rows, such that the m-th matrix power satisfies T^m = I + m*(T - I) and consequently the matrix logarithm satisfies log(T) = T - I, where I is the identity matrix. A112555

Powers of -2: a(n) = (-2)ⁿ. A122803

Expansion of e.g.f. cos(x) / exp(x). A9116

Riordan array (1/(1-x), x/(1+x)). A112468

Triangle read by rows: coefficients T(n,k) of a binomial decomposition of 1 as ∑_k=0..n T(n,k)*binomial(n,k). A244116

Triangle read by rows: coefficients T(n,k) of a binomial decomposition of 2ⁿ-1 as Sum(k=0..n)T(n,k)*binomial(n,k). A244126

Triangle read by rows: terms T(n,k) of a binomial decomposition of 2ⁿ-1 as Sum(k=0..n)T(n,k). A244127

Triangle read by rows: coefficients T(n,k) of a binomial decomposition of 0^n-1 as Sum(k=0..n)T(n,k)*binomial(n,k). A244128

a(2·n) = 2ⁿ; a(2·n+1) = -(2ⁿ⁺¹). A152166