Properties of the Number -44562

Forty-Four Thousand Five Hundred Sixty-Two

Basics

Value: -44563 → -44562 → -44561

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 7 × 1061

Divisors: 1, 2, 3, 6, 7, 14, 21, 42, 1061, 2122

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010111000010010

Octal: -127022

Duodecimal: -21956

Hexadecimal: -ae12

Square: 1985771844

Square Root: 211.09713404023276

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

Number of partitions of n into 3 or more parts. A4250

T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum, adjacent elements differing by more than one, and elements alternately increasing and decreasing. A200192

Number of integer partitions of n into three or more parts or into two equal parts. A349801

The PD_t(n) function (Number of tagged parts over all the partitions of n with designated summands). A293421

Denominators of continued fraction convergents to sqrt(583). A42117

"DFK" (bracelet, size, unlabeled) transform of 2,2,2,2... A32214

Number of distinct solutions of sum{i=1..3}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 1..n-1. A180774

Number of -4..4 arrays x(0..n-1) of n elements with zero sum, adjacent elements differing by more than one, and elements alternately increasing and decreasing. A200188