Properties of the Number -22566

Twenty-Two Thousand Five Hundred Sixty-Six

Basics

Value: -22567 → -22566 → -22565

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 3761

Divisors: 1, 2, 3, 6, 3761, 7522, 11283, 22566

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101100000100110

Octal: -54046

Duodecimal: -11086

Hexadecimal: -5826

Square: 509224356

Square Root: 150.21983890285597

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

Triangle read by rows: T(n,k) is the number of labeled commutative monoids of order n with k idempotents and a fixed identity. A58160

Number of labeled lattices with a fixed bottom. A58164

Expansion of e.g.f. ∏_k>=1 (1 + (exp(x)-1)^k²) / (1 - (exp(x)-1)^k²). A306147

Number of certain self-avoiding walks with n steps on square lattice (see reference for precise definition). A2976

Triangle read by rows: T(n,k) is the number of labeled commutative semigroups of order n with k idempotents. A58167

Number of collections of nonempty multisets with a total of n objects of exactly two colors. A255942

Sum of the asymmetry degrees of all compositions of n without 2's. A275443

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (composite numbers). A24480

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...), t = (composite numbers). A25100

Number of prefix-closed polyominoes of area n. A275943