Properties of the Number -45570

Forty-Five Thousand Five Hundred Seventy

Basics

Value: -45571 → -45570 → -45569

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 7 ² × 31

Divisors: 1, 2, 3, 5, 6, 7, 10, 14, 15, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1011001000000010

Octal: -131002

Duodecimal: -22456

Hexadecimal: -b202

Square: 2076624900

Square Root: 213.4713095476767

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) is the number of compositions of the set {1, 2, ..., n} into blocks, each of size 1, 2 or 3 (n >= 0). A189886

Number A(n,k) of ordered set partitions of [n] with at most k elements per block; square array A(n,k), n>=0, k>=0, read by antidiagonals. A276921

Numbers k such that σ(k) = ψ(k) + τ(k)². A390296

Sums of groups in A075643. A75645

Number of partitions of n in which any two parts differ by at most 9. A218511

Numbers n such that n² is a sum of 2 and also of 4 consecutive primes. A252066

Unitary practical numbers that are nonsquarefree. A287173

Expansion of e.g.f. (1/x) * Series_Reversion( x*(1 - x³*exp(x)) ). A370985

Number of ordered partitions of an n-set into blocks of size <= n/2. A368512

Symmetrical product form polynomial as triangle sequence coefficients: q(x,n)=Product[x + 2·n - i + 1, {i, 0, n - 1}]; p(x,n)=q(x,n)+x²+xⁿ*q(1/x,m);t(n,m)=coefficients(p(x,n). A155725