Properties of the Number -45560

Forty-Five Thousand Five Hundred Sixty

Basics

Value: -45561 → -45560 → -45559

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 5 × 17 × 67

Divisors: 1, 2, 4, 5, 8, 10, 17, 20, 34, 40

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1011000111111000

Octal: -130770

Duodecimal: -22448

Hexadecimal: -b1f8

Square: 2075713600

Square Root: 213.44788591129216

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

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A251037

a(n) = ∑_{k=0..floor(n/4)} binomial(n+3,4·k+3) * Catalan(k). A360046

Numbers k such that k*∑_d∣k 1/σ(d) is an integer. A69166

Number of (n+1)X(3+1) 0..3 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A251032

Number of (2+1)X(n+1) 0..3 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A251039

Number of n X 3 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors less than or equal to itself. A266050

Number of nX7 0..1 arrays with every element unequal to 0, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A318422