Properties of the Number 22668

Twenty-Two Thousand Six Hundred Sixty-Eight

Basics

Value: 22667 → 22668 → 22669

Parity: even

Prime: No

Previous Prime: 22651

Next Prime: 22669

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 1889

Divisors: 1, 2, 3, 4, 6, 12, 1889, 3778, 5667, 7556

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101100010001100

Octal: 54214

Duodecimal: 11150

Hexadecimal: 588c

Square: 513838224

Square Root: 150.55895855112706

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

Expansion of ∏_k>=1 (1 + x^k * (1 + k·x)). A336980

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of (B(x)/x)^k, where B(x) is the g.f. of A213639. A384620

Number of rooted trees with n nodes and 7 leaves. A55282

Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,21. A64247

Consider necklaces with n beads, each of one of four colors (say C1, C2, C3, C4), where the n segments of cord between the beads are each colored red or green; a(n) is the number of different necklaces under the action of the dihedral group D_2n. A161222

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 1), (1, 0, -1), (1, 1, 1)}. A149264

Expansion of ∏_m>=1 (1 - m·q^m)⁸. A22668

Number of (n+1) X 4 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two equal edges, and new values 0..3 introduced in row major order. A206233