Properties of the Number -44551

Forty-Four Thousand Five Hundred Fifty-One

Basics

Value: -44552 → -44551 → -44550

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 13 × 23 × 149

Divisors: 1, 13, 23, 149, 299, 1937, 3427, 44551

Polygonal

Triangular: Yes

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1010111000000111

Octal: -127007

Duodecimal: -21947

Hexadecimal: -ae07

Square: 1984791601

Square Root: 211.0710780756094

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

MM-numbers of labeled graphs with loops spanning an initial interval of positive integers. A320461

a(n) = n*(94 + 5·n + 25·n² - 5·n³ + n⁴)/120. A57703

Number of partitions of n that do not contain 4 as a part. A27338

a(n) = 1·t(n) + 2·t(n-1) + ... + k·t(n+1-k), where k=floor((n+1)/2) and t = (F(2), F(3), F(4), ...), F(n) = Fibonacci(n). A23864

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (Fibonacci numbers). A24857

Triangular numbers composed of digits {1,4,5}. A119123

The non-common part of the smaller number of an amicable pair. A180326

a(n) = 1·t(n) + 2·t(n-1) + ... + k·t(n+1-k), where k=floor((n+1)/2), t = A000045 (Fibonacci numbers). A23860

Triangular numbers which are one more than a product of distinct triangular numbers. A83517

Triangular numbers whose sum of aliquot divisors is a prime number. A83676