Properties of the Number -31240

Thirty-One Thousand Two Hundred Forty

Basics

Value: -31241 → -31240 → -31239

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 5 × 11 × 71

Divisors: 1, 2, 4, 5, 8, 10, 11, 20, 22, 40

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111101000001000

Octal: -75010

Duodecimal: -160B4

Hexadecimal: -7a08

Square: 975937600

Square Root: 176.7484087622856

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

Expansion of exp( ∑_n>=1 -sigma₂(2·n)*xⁿ/n ) in powers of x. A283242

Tetranacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4), with a(0)=a(1)=0, a(2)=1, a(3)=2. A1630

Fishburn numbers: number of linearized chord diagrams of degree n; also number of nonisomorphic interval orders on n unlabeled points. A22493

Number of subsets of {1..n} such that it is not possible to choose a different prime factor of each element. A370583

a(n) = (n+1)*(n²+n+2)/2; g.f.: (1 + 2·x²) / (1 - x)⁴. A6000

a(n) = ∑_{k=0..floor(n/2)} A026615(n-k,k). A26625

T(n,k)=Number of length n+4 0..k arrays with no disjoint pairs in any consecutive five terms having the same sum. A247404

T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 111 in rows and columns. A202378

Triangle T(n,d) read by rows: Number of ascent sequences of length n with d zeros. A175579

T(n,k)=Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any horizontal, vertical or antidiagonal neighbor in a random 0..2 nXk array. A219106