Properties of the Number -45084

Forty-Five Thousand Eighty-Four

Basics

Value: -45085 → -45084 → -45083

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 13 × 17 ²

Divisors: 1, 2, 3, 4, 6, 12, 13, 17, 26, 34

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1011000000011100

Octal: -130034

Duodecimal: -22110

Hexadecimal: -b01c

Square: 2032567056

Square Root: 212.32993194554555

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

Coefficient of y⁰ in G(x,y)⁴ where G(x,y) = ∑_n=-oo..+oo (1-xⁿ)ⁿ * xⁿ * yⁿ. A263189

Sum of three solutions of the Diophantine equation x² - y² = z³. A85409

Consider the tiling of the plane with squares of two different sizes as in Fig. 2.4.2(g) of Grünbaum and Shephard, p. 74. a(n) is the number of connected figures that can be formed on this tiling, from n big squares and n small squares. A121195

E.g.f. A(x) satisfies A(x) = 1 + log(1+x) * A(2·log(1+x)). A355120

Numbers k such that the sum of the proper divisors of k that have the same binary weight as k is larger than k, and no subset of these divisors sums to k. A381071

Number of binary strings of length n with no substrings equal to 0001 0011 or 1011. A164458

Backward iterated ( limited ) Fibonacci approximation: A000045. A116557

Number of walks within N² (the first quadrant of Z²) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 0), (0, 1), (1, 0)}. A151386