Properties of the Number -199497

One Hundred Ninety-Nine Thousand Four Hundred Ninety-Seven

Basics

Value: -199498 → -199497 → -199496

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 39

Digital Root: 3

Palindrome: No

Factorization: 3 × 66499

Divisors: 1, 3, 66499, 199497

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -110000101101001001

Octal: -605511

Duodecimal: -97549

Hexadecimal: -30b49

Square: 39799053009

Square Root: 446.65087036744933

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)=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, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0. A223504

T(n,k)=Number of 0..2 colorings of an nx(k+1) array circular in the k+1 direction with new values 0..2 introduced in row major order. A214101

Number of 2 X n matrices containing a 1 in the top left entry, all entries are integer values and adjacent entries differ by at most 1. A138977

T(n,k)=Number of nXk 0..4 arrays with entries increasing mod 5 by 0, 1 or 2 rightwards and downwards, starting with upper left zero. A222169

Number of 0..2 colorings of a 7X(n+1) array circular in the n+1 direction with new values 0..2 introduced in row major order. A214106

Number of nX7 0..4 arrays with entries increasing mod 5 by 0, 1 or 2 rightwards and downwards, starting with upper left zero. A222168

Petersen graph (3,1) coloring a rectangular array: number of 7Xn 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, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0. A223510