Properties of the Number -8944

Nine Hundred Forty-Four

Basics

Value: -8945 → -8944 → -8943

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁴ × 13 × 43

Divisors: 1, 2, 4, 8, 13, 16, 26, 43, 52, 86

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10001011110000

Octal: -21360

Duodecimal: -5214

Hexadecimal: -22f0

Square: 79995136

Square Root: 94.57272334029511

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

Sum of cubes of the first n primes. A98999

Nonnegative values·of solutions (x, y) to the Diophantine equation x² + (x + 23)² = y². A118337

Number T(n,k) of blocks of size >= k in all set partitions of [n], assuming that every set partition contains one block of size zero; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A283424

G.f. satisfies: A(x) = 1 + x² + x·A(x)². A176697

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock diagonal sum plus antidiagonal median nondecreasing horizontally and vertically. A254894

Numbers which are representable as a sum of thirteen but no fewer consecutive nonnegative integers. A270300

a(n) = 8·n² + 7·n + 1. A194268

T(n,k)=Number of nXk arrays of permutations of 0..n·k-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 5. A264659

a(n) = dot_product(1,2,...,n)*(7,8,...,n,1,2,3,4,5,6). A26049

a(n) is the smallest index m such that ∑_k=2..m 1/PrimePi(k) >= n, where PrimePi()=A000720(). A74633