Properties of the Number -45408

Forty-Five Thousand Four Hundred Eight

Basics

Value: -45409 → -45408 → -45407

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ⁵ × 3 × 11 × 43

Divisors: 1, 2, 3, 4, 6, 8, 11, 12, 16, 22

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1011000101100000

Octal: -130540

Duodecimal: -22340

Hexadecimal: -b160

Square: 2061886464

Square Root: 213.09152962987525

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-bead necklaces labeled with numbers -k..k not allowing reversal, with sum zero and avoiding the pattern z z+1 z+2. A209073

Numbers k such that sopfr(k + sopfr(k)) = sopfr(k) + sopfr(sopfr(k)), where sopfr = A001414. A376851

Partial sums of A140091. A267370

Start with the hexagonal tile of the Shield tiling and recursively apply the substitution rule. a(n) is the number of hexagonal tiles after n iterations. A298678

Structured rhombic triacontahedral numbers (vertex structure 11). A100164

Odd power perfect numbers: numbers k such that opsigma(k) = 2·k, where opsigma(k) = A033634(k). A33289

θ series of lattice Kappa₉. A15233

Number of partitions of n into at most 1² copy of 1, 2² copies of 2, 3² copies of 3, ... . A303944

Number of n-bead necklaces labeled with numbers -3..3 not allowing reversal, with sum zero and avoiding the pattern z z+1 z+2. A209068

a(n) = [xⁿ] 1 + x*(1 + x²*(1 + x³*(1 + x⁴*(1 + x⁵*(1 + ...)ⁿ)ⁿ)ⁿ)ⁿ)ⁿ. A302693