Properties of the Number -31779

Thirty-One Thousand Seven Hundred Seventy-Nine

Basics

Value: -31780 → -31779 → -31778

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 11 × 107

Divisors: 1, 3, 9, 11, 27, 33, 99, 107, 297, 321

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111110000100011

Octal: -76043

Duodecimal: -16483

Hexadecimal: -7c23

Square: 1009904841

Square Root: 178.26665420094696

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

Number of integer partitions of n where the parts do not have the same median as the distinct parts. A360244

Starting numbers for which the RATS sequence has eventual period 3. A114613

a(0) = 1, a(1) = 3, a(n) = 3·n*a(n-1) + a(n-2). A305459

[s(k)-s(j)]/10, where the pairs (k,j) are given by A205877 and A205878, and s(k) denotes the (k+1)-st Fibonacci number. A205880

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where A(n,k) is ∑_{j=0..floor(n/2)} ((n-j)!/j!)*binomial(n-j,j)*k^n-2·j. A305401

Partial sums of A066259: a(n) = ∑_k=0..n F(k+1)²*F(k), n>=0, with the Fibonacci numbers F=A000045. A215038

Numbers n such that A242720(n) = prime(n)*(prime(n)+4)+3 and A242719(n) - A242720(n) = 2*(prime(n)-1). A247279

Number of nX5 0..1 arrays with every element equal to 0, 2, 4, 5 or 7 king-move adjacent elements, with upper left element zero. A298572