Properties of the Number -59698

Fifty-Nine Thousand Six Hundred Ninety-Eight

Basics

Value: -59699 → -59698 → -59697

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 37

Digital Root: 1

Palindrome: No

Factorization: 2 × 19 × 1571

Divisors: 1, 2, 19, 38, 1571, 3142, 29849, 59698

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1110100100110010

Octal: -164462

Duodecimal: -2A66A

Hexadecimal: -e932

Square: 3563851204

Square Root: 244.33174169558896

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)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any north or northeast neighbors modulo n and the upper left element equal to 0. A267553

a(n) = [x^2ⁿ+n-1] (x + x² + x⁴ + x⁸ + ... + x^2ⁿ)ⁿ / n for n>=1. A135069

Start with 209; if even, divide by 2; if odd, add the next three primes: Trajectory of 209 under iterations of A174221, the "PrimeLatz" map. A293981

Number of 3Xn arrays containing n copies of 0..3-1 with no element 1 greater than its north or northeast neighbor modulo 3 and the upper left element equal to 0. A266600

"DFK" (bracelet, size, unlabeled) transform of 2,1,1,1... A32215

Number of 2Xn 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards. A281564