Properties of the Number -7123

One Hundred Twenty-Three

Basics

Value: -7124 → -7123 → -7122

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 17 × 419

Divisors: 1, 17, 419, 7123

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1101111010011

Octal: -15723

Duodecimal: -4157

Hexadecimal: -1bd3

Square: 50737129

Square Root: 84.39786727163192

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

Number of unlabeled nonseparable (or 2-connected) graphs (or blocks) with n nodes. A2218

Number of pairwise coprime strict compositions of n, where a singleton is always considered coprime. A337562

Expansion of g.f. sqrt( (1-x + sqrt(1-14·x+x²)) / (2*(1-14·x+x²)) ). A245926

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of sqrt((1+(k-4)*x+sqrt(1-2*(k+4)*x+((k-4)*x)²)) / (2 * (1-2*(k+4)*x+((k-4)*x)²))). A337389

Numbers k such that σ(k) divides σ(φ(k)). A66831

Numbers n such that σ(φ(n))/σ(n) = 2. A67382

Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k articulation vertices, (0 <= k <= n). A325111

Number of integer compositions of n whose leaders of weakly increasing runs are not strictly decreasing. A375140

Irregular triangle: T(n,k) gives the number of k-polysticks on edges of the n-cube up to rotational symmetries of the n-cube, with 0 <= k <= A001787(n). A383799

Numbers k such that k and 8·k, taken together, are zeroless pandigital. A115932