Properties of the Number -131008

One Hundred Thirty-One Thousand Eight

Basics

Value: -131009 → -131008 → -131007

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ⁶ × 23 × 89

Divisors: 1, 2, 4, 8, 16, 23, 32, 46, 64, 89

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11111111111000000

Octal: -377700

Duodecimal: -63994

Hexadecimal: -1ffc0

Square: 17163096064

Square Root: 361.9502728276358

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

Numbers whose binary representation is the concatenation of 2n-1 digits 1 and n digits 0. A147537

a(n) = 64*(2ⁿ - 1). A175166

Number of (n+1)X(1+1) 0..1 arrays with every 2X2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically. A258547

a(n) is the number of distinct patterns (modulo geometric D3-operations) with strict median-reflective (palindrome) symmetry (i.e., having no other symmetry) which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells. A60549

a(n) = 4 + 2ⁿ - 4·n. A302689

Expansion of 1 / AGM(1, 1 - 8·x)² in powers of x. A327834