Properties of the Number -102124

One Hundred Two Thousand One Hundred Twenty-Four

Basics

Value: -102125 → -102124 → -102123

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 11 ² × 211

Divisors: 1, 2, 4, 11, 22, 44, 121, 211, 242, 422

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -11000111011101100

Octal: -307354

Duodecimal: -4B124

Hexadecimal: -18eec

Square: 10429311376

Square Root: 319.5684590193469

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

Structured meta-prism numbers, the n-th number from a structured n-gonal prism number sequence. A100177

T(n,k)=Two-loop graph coloring a rectangular array: number of nXk 0..4 arrays where 0..4 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223255

T(n,k)=3X3X3 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223352

Fourth left hand column of triangle A163940. A163944

Number of ways to place 2 nonattacking nightriders on an n X n cylindrical board. A196810

Two-loop graph coloring a rectangular array: number of n X 2 0..4 arrays where 0..4 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223249

Numbers that are values of the totient function (A002202) but not of the reduced totient function (A002174). A270265

Two-loop graph coloring a rectangular array: number of nX7 0..4 arrays where 0..4 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223254

3X3X3 triangular graph without horizontal edges coloring a rectangular array: number of nX7 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223351