Properties of the Number -209088

Two Hundred Nine Thousand Eighty-Eight

Basics

Value: -209089 → -209088 → -209087

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ⁶ × 3 ³ × 11 ²

Divisors: 1, 2, 3, 4, 6, 8, 9, 11, 12, 16

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -110011000011000000

Octal: -630300

Duodecimal: -A1000

Hexadecimal: -330c0

Square: 43717791744

Square Root: 457.2614131981836

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 (w,x,y,z) with all terms in {1,...,n} and w<2x and y<3z. A212508

Triangle read by rows: T(n,k) = number of heapable permutations of length n with exactly k decreasing runs. A389255

Triangle read by rows: T(n,k) = (n+1-k)*|s(n,n+1-k)| - 2*|s(n-1,n-k)|, where s(n,k) are the signed Stirling numbers of the first kind and 1 <= k <= n. A199221

a(n) = 121·12^n-2, a(0)=1, a(1)=10. A56116

Non-perfect powers k for which q = A051903(k)/A051904(k) is an integer, A051904(k) > 1. A93770

a(n) = n² * (n+1)³. A99762

Number of 2-step self-avoiding walks on an n X n X n cube summed over all starting positions. A187163

Conductor of the elliptic curve y² = x³ + n. A356730

Conductor of the elliptic curve y² = x³ - n. A356731

Triangle read by rows: T(n,k) = number of heapable permutations of length n with exactly k increasing runs. A389487