Properties of the Number 22908

Twenty-Two Thousand Nine Hundred Eight

Basics

Value: 22907 → 22908 → 22909

Parity: even

Prime: No

Previous Prime: 22907

Next Prime: 22921

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 23 × 83

Divisors: 1, 2, 3, 4, 6, 12, 23, 46, 69, 83

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101100101111100

Octal: 54574

Duodecimal: 11310

Hexadecimal: 597c

Square: 524776464

Square Root: 151.35388994010032

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

Irregular triangle in which row n has the values of k>n such that ∑_i=n..k i² is a square. A184763

Sum of the second largest parts of the partitions of n into 9 parts. A326472

a(n) = prime(n)*T(n), where T = A000217. A196421

Number of unoriented polyominoes with n octagonal cells of the hyperbolic regular tiling with Schläfli symbol {8,oo}. A389937

Smallest m > n such that ∑_i=n..m i² is a square, or 0 if no such m exists. A75404

Row sums in A083175. A83175

Number of set partitions of [n] such that the difference between each element and its index (in the partition) is a multiple of four. A274861

Array read by antidiagonals: T(n,k) = number of nonequivalent dissections of a polygon into n k-gons by nonintersecting diagonals up to rotation and reflection (k >= 3). A295260

The sequence M(n) in A022905. A22908

Number of nX3 0..2 arrays with every 0 next to a 1 and every 1 next to a 2 horizontally, vertically or antidiagonally. A232304