Properties of the Number -250880

Two Hundred Fifty Thousand Eight Hundred Eighty

Basics

Value: -250881 → -250880 → -250879

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ¹⁰ × 5 × 7 ²

Divisors: 1, 2, 4, 5, 7, 8, 10, 14, 16, 20

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -111101010000000000

Octal: -752000

Duodecimal: -101228

Hexadecimal: -3d400

Square: 62940774400

Square Root: 500.8792269599529

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

Quintisection and binomial transform of 1/(1-x⁴-x⁵). A99131

a(n) = ∑_{k=0..floor(n/2)} binomial(k,2*(n-2·k)). A392250

a(n) = gcd(d(n!³), d(n!)), where d() is the number of divisors function. A69783

a(n) is the least number with exactly n divisors of the form 3·k+2. A364583

a(n) = 4·a(n-1) - 6·a(n-2) + 4·a(n-3) - a(n-4) + a(n-5) with a(1) = a(2) = a(3) = 0, a(4) = 1, and a(5) = 3. A385142

Triangle whose (i,j)-th entry is binomial(i,j)*8^i-j*7^j. A38285

Consider the list s(1), s(2), ... of numbers that are products of exactly n primes; a(n) is the smallest s(j) whose decimal expansion ends in j. A186000

Number of length n+4 0..7 arrays with every five consecutive terms having two times the sum of some three elements equal to three times the sum of the remaining two. A248986

Triangle whose (i,j)-th entry is binomial(i,j)*7^i-j*8^j. A38274