Properties of the Number -31180

Thirty-One Thousand One Hundred Eighty

Basics

Value: -31181 → -31180 → -31179

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 5 × 1559

Divisors: 1, 2, 4, 5, 10, 20, 1559, 3118, 6236, 7795

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111100111001100

Octal: -74714

Duodecimal: -16064

Hexadecimal: -79cc

Square: 972192400

Square Root: 176.57859439920796

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

Alternating sum of octagonal pyramidal numbers. A269429

Number of compositions of n where differences between neighboring parts are in {-1,1}. A173258

a(n) = ∑_k=0..6 binomial(n,k). A8859

a(n) = ∑_k=0..n binomial(3·n,k). A66380

T(n,k)=Number of length n+5 0..k arrays with no six consecutive terms having the maximum of any two terms equal to the minimum of the remaining four terms. A249960

Sum of the lengths of the cycle types of the permutation created by length sorting on the partitions of n. A36056

Irregular table read by rows: T(n,k) is the number of permutations in S_n that have exactly k occurrences of the pattern 2413. 0 <= k <= A342854(n). A342860

Consider the Diophantine equation x³ + y³ = z³ + 1 (1<x<y<z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791), and increasing values of y in case of ties. Sequence gives values of y. A50793

a(n) = number of subsets of {1,2,...,n} that contain more primes than nonprimes. A369780

Number T(n,k) of set partitions of [n] having exactly k triples (t,t+1,t+2) such that t+i is in block b+i for some b; triangle T(n,k), n>=0, 0<=k<=max(0,n-2), read by rows. A271206