Properties of the Number -609309

Six Hundred Nine Thousand Three Hundred Nine

Basics

Value: -609310 → -609309 → -609308

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 22567

Divisors: 1, 3, 9, 27, 22567, 67701, 203103, 609309

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -10010100110000011101

Octal: -2246035

Duodecimal: -254739

Hexadecimal: -94c1d

Square: 371257457481

Square Root: 780.5824748224879

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 lower triangles of an n X n integer array with each element differing from all of its vertical and horizontal neighbors by k or less and triangles differing by a constant counted only once. A195278

T(n,k)=Petersen graph (3,1) coloring a rectangular array: number of nXk 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0. A223556

Number of symmetric n X n integer matrices with adjacent elements differing by no more than 1, counting matrices differing by a constant only once. A141441

Number of lower triangles of a 5X5 integer array with each element differing from all of its vertical and horizontal neighbors by n or less and triangles differing by a constant counted only once. A195281

Petersen graph (3,1) coloring a rectangular array: number of n X 5 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0. A223553

Petersen graph (3,1) coloring a rectangular array: number of 3 X n 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0. A223558