Properties of the Number -200880

Two Hundred Thousand Eight Hundred Eighty

Basics

Value: -200881 → -200880 → -200879

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ⁴ × 5 × 31

Divisors: 1, 2, 3, 4, 5, 6, 8, 9, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -110001000010110000

Octal: -610260

Duodecimal: -98300

Hexadecimal: -310b0

Square: 40352774400

Square Root: 448.1963855275944

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

Triangle S(n,k) by rows: coefficients of 6^(n-1/2)*(x^1/6*d/dx)ⁿ when n is odd, and of 6^n/2*(x^5/6*d/dx)ⁿ when n is even. A223172

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits. A262420

Triangular array read by rows: row n shows the coefficients of the polynomial p(x,n) constructed as in Comments; these polynomials form a strong divisibility sequence. A327323

Integers with exactly 100 divisors. A163816

Number of (n+1) X (4+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits. A262416

Number of (5+1)X(n+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits. A262424

a(n) = product of nonzero entries in row n of A235791. A339577

Triangle S(n,k) by rows: coefficients of 6^(n-1/2)*(x^1/6*d/dx)ⁿ when n=1,3,5,... A223531

a(n) is the largest denominator when the greedy algorithm for Egyptian fractions is applied to 1/n + 1/(n+1). A362289