Properties of the Number -122770

One Hundred Twenty-Two Thousand Seven Hundred Seventy

Basics

Value: -122771 → -122770 → -122769

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 × 12277

Divisors: 1, 2, 5, 10, 12277, 24554, 61385, 122770

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -11101111110010010

Octal: -357622

Duodecimal: -5B06A

Hexadecimal: -1df92

Square: 15072472900

Square Root: 350.3855019831728

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

T(n,k)=Number of nXk 0..1 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value. A267788

Triangle, read by rows, where the g.f. of column k, C_k(x), is defined by the recursion: C_k(x) = ( 1 + ∑_n>=1 xⁿ*C_n-1+k(x) )^k+1. A127082

Column 3 of triangle A127082. A127086

Sum of distances between greatest-part-order and length-order of partitions of n. A36051

Number of nX5 0..1 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value. A267785

Number of 5Xn 0..1 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value. A267791

Number of n X n 0..1 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value. A267782