Properties of the Number -7826

Eight Hundred Twenty-Six

Basics

Value: -7827 → -7826 → -7825

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 7 × 13 × 43

Divisors: 1, 2, 7, 13, 14, 26, 43, 86, 91, 182

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1111010010010

Octal: -17222

Duodecimal: -4642

Hexadecimal: -1e92

Square: 61246276

Square Root: 88.46468221838589

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

The n-th n-gonal number: a(n) = n*(n² - 3·n + 4)/2. A60354

Jablonski table T(n,k) read by antidiagonals: T(n,k) = number of necklaces with n beads of k colors. A75195

Number of equivalence classes of n-valued Post functions of 1 variable under action of complementing group C(1,n). A56665

Square array read by descending antidiagonals: T(n,k) is the number of n-bead necklaces of k colors not allowing reversal, with no adjacent beads having the same color (n, k >= 1). A208535

MacMahon's generalized sum of divisors function. A2128

26-gonal numbers: a(n) = n*(12·n-11). A255185

Number of n-bead necklaces with 6 colors. A54625

T(n,k) = ∑_d∣k φ(d)*n^k/d/k, triangle read by rows, T(n,k) for n >= 1 and 1 <= k <= n. A54630

Number of ways to color vertices of a hexagon using <= n colors, allowing only rotations. A6565

Numbers that divide the sum of cubes of their divisors. A46763