Properties of the Number -26131

Twenty-Six Thousand One Hundred Thirty-One

Basics

Value: -26132 → -26131 → -26130

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 7 × 3733

Divisors: 1, 7, 3733, 26131

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110011000010011

Octal: -63023

Duodecimal: -13157

Hexadecimal: -6613

Square: 682829161

Square Root: 161.65085833363213

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

a(n) = n³ - 4·n² + 6·n - 2. A188377

T(n,k) = Number of (n+1) X (k+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits. A262332

Number of ways to get ten-pin bowling score of 300-n. A79596

Number of (n+1) X (4+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits. A262328

Number of (n+1)X(5+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits. A262329

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 675", based on the 5-celled von Neumann neighborhood. A273408

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 1, 0), (1, -1, -1), (1, 1, 1)}. A150358

Least b > 1 such that (b^prime(n²) - 1)/(b^prime(n) - 1) is prime. A353101