Properties of the Number -59830

Fifty-Nine Thousand Eight Hundred Thirty

Basics

Value: -59831 → -59830 → -59829

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 31 × 193

Divisors: 1, 2, 5, 10, 31, 62, 155, 193, 310, 386

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: Yes

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1110100110110110

Octal: -164666

Duodecimal: -2A75A

Hexadecimal: -e9b6

Square: 3579628900

Square Root: 244.60171708309818

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

Binomial transform of Moebius sequence. A104688

Expansion of x/((1 - x - x⁴)*(1 - x)²). A145131

G.f.: ∑_n>=0 (n+1)*(n+2)/2·xⁿ * (1 + xⁿ)ⁿ. A326003

Triangle read by rows: T(n,k) is the number of simple digraphs on labeled n nodes with k strongly connected components. A361455

Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] with exactly k strongly connected components of size 1, n>=0, 0<=k<=n. A361592

Number of nX7 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. A281468

Heptagonal numbers which are products of four distinct primes. A351867

Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] having exactly k strongly connected components all of which are simple cycles, n >= 0, 0 <= k <= n. A361527