Properties of the Number -840456

Eight Hundred Forty Thousand Four Hundred Fifty-Six

Basics

Value: -840457 → -840456 → -840455

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ⁴ × 1297

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 18, 24

Polygonal

Triangular: Yes

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -11001101001100001000

Octal: -3151410

Duodecimal: -346460

Hexadecimal: -cd308

Square: 706366287936

Square Root: 916.7638736337727

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²*(n² + 1)/2. A37270

T(n,k)=5X5X5 triangular graph coloring a rectangular array: number of nXk 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 3,6 3,7 4,7 6,7 4,8 5,8 7,8 5,9 8,9 6,10 6,11 7,11 10,11 7,12 8,12 11,12 11,12 8,13 9,13 12,13 9,14 13,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223344

Number of reversible strings with n beads using a maximum of six different colors. A56308

a(n) = (n⁸ + n⁴)/2. A71231

If·is in the sequence then so are x² and x(x+1)/2. A241241

5 X 5 X 5 triangular graph coloring a rectangular array: number of n X 2 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 3,6 3,7 4,7 6,7 4,8 5,8 7,8 5,9 8,9 6,10 6,11 7,11 10,11 7,12 8,12 11,12 11,12 8,13 9,13 12,13 9,14 13,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223338

5X5X5 triangular graph coloring a rectangular array: number of nX5 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 0,2 1,2 1,3 1,4 2,4 3,4 2,5 4,5 3,6 3,7 4,7 6,7 4,8 5,8 7,8 5,9 8,9 6,10 6,11 7,11 10,11 7,12 8,12 11,12 11,12 8,13 9,13 12,13 9,14 13,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223341

Number of 3 X n 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally or antidiagonally. A233156

Square array read by antidiagonals upwards: T(i,j) is the smallest number m such that the symmetric representation of σ, SRS(m), has maximum width 3, consists of i parts and has 2·j occurrences of maximum width 3 in its width pattern (row m of A341969). A377667

Sum of next n numbers/n if n divides the sum else n times the sum of next n numbers. A94260