Properties of the Number -44000

Forty-Four Thousand

Basics

Value: -44001 → -44000 → -43999

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 ⁵ × 5 ³ × 11

Divisors: 1, 2, 4, 5, 8, 10, 11, 16, 20, 22

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010101111100000

Octal: -125740

Duodecimal: -21568

Hexadecimal: -abe0

Square: 1936000000

Square Root: 209.76176963403032

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

Numbers n such that A048767(n) = n. A48768

Numbers whose ordered prime signature is equal to the set of distinct prime indices in decreasing order. A324571

Numbers whose decimal expansion contains only 0's and 4's. A169967

Numbers with prime factorization pq^3r^5. A190011

Records in A160256. A151545

Numbers such that each digit is the sum of two or more other digits. A203591

Composite numbers m such that ∑_i=1..k (p_i/(p_i+1)) - ∏_i=1..k (p_i/(p_i-1)) is an integer, where p_i are the k prime factors of m (with multiplicity). A230111

a(n) = n*(n + 1)*(19·n - 16)/6. A237618

Number of irredundant sets in the n-Fibonacci cube graph. A291963

Irregular triangle T(n,k), n >= 0, 0 <= k < 2^n-1, where T(n,k) = ∏_j=0..n-1 prime(j+1)^(n-j*d_j), where d_j is the bit with digit weight 2^j in the binary expansion of 2^n-1+k. A384003