Properties of the Number -44982

Forty-Four Thousand Nine Hundred Eighty-Two

Basics

Value: -44983 → -44982 → -44981

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ³ × 7 ² × 17

Divisors: 1, 2, 3, 6, 7, 9, 14, 17, 18, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1010111110110110

Octal: -127666

Duodecimal: -22046

Hexadecimal: -afb6

Square: 2023380324

Square Root: 212.08960370560365

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

Riordan array (1/sqrt(1-6x+5x²),(1-3x-sqrt(1-6x+5x²))/(2x)). A110165

a(n) is the total number of down steps between the 2nd and 3rd up steps in all 2-Dyck paths of length 3·n. A 2-Dyck path is a nonnegative lattice path with steps (1, 2), (1, -1) that starts and ends at y = 0. A334640

a(n) = (7ⁿ/n!²) * ∏_k=0..n-1 (14k+3)*(14k+4). A185403

Values of y in solutions (x,y,z) to the Diophantine equation x³-x²+y³-y²=z³-z², with 1<x<y<z arranged in order of increasing x. A138668

a(n) = (1/2) * ∑_{k=0..floor(n/3)} 3^n-2·k * binomial(2·n-4·k+2,2·k+1). A387604

Number of -n..n arrays x(0..3) of 4 elements with zero sum and elements alternately strictly increasing and strictly decreasing. A200058

A008336(n) is divisible by the product of the primes p such that n/2 <= p < n; a(n) is the quotient. A370971