Properties of the Number -45056

Forty-Five Thousand Fifty-Six

Basics

Value: -45057 → -45056 → -45055

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ¹² × 11

Divisors: 1, 2, 4, 8, 11, 16, 22, 32, 44, 64

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1011000000000000

Octal: -130000

Duodecimal: -220A8

Hexadecimal: -b000

Square: 2030043136

Square Root: 212.2639865827456

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

a(n) = 2ⁿ*(1-n). A159964

a(n) = 4ⁿ*(1-2·n). A144704

a(n) = coefficient of xⁿ in A(x) such that C(x)² + S(x)² = 1 where: C(x) + i·S(x) = ∑_n=-oo..+oo iⁿ * (2·x)^n² * A(x)ⁿ. A357787

Coefficient array for orthogonal polynomials defined by C(2n,n). A128411

Irregular triangle, T(n, k) = coefficients of p(x, n), where p(x, n) = (1-2·x)ⁿ⁺¹ * ∑_j>=0 jⁿ*(x/(1-x))^j, read by rows. A142073

Binomial transform of [0, 1, 2, -3, -4, 5, 6, -7, -8, ...]. A316386

Triangle read by rows, T(n, k) = ∑_j=0..n (-1)^k-j*Eulerian1(n, j)* binomial(n-j, n-k) for 0 <= k <= n. A291977

13-almost primes (generalization of semiprimes). A69274

Numbers k such that ∑_j p_j = ∑_j e_j where ∏_j p_j^e_j is the prime factorization of k. A54411

a(n) = 11·2ⁿ. A5015