Properties of the Number 22904

Twenty-Two Thousand Nine Hundred Four

Basics

Value: 22903 → 22904 → 22905

Parity: even

Prime: No

Previous Prime: 22901

Next Prime: 22907

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ³ × 7 × 409

Divisors: 1, 2, 4, 7, 8, 14, 28, 56, 409, 818

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101100101111000

Octal: 54570

Duodecimal: 11308

Hexadecimal: 5978

Square: 524593216

Square Root: 151.3406752991409

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,m) (n >= m >= 1) = number of regions (or cells) formed by drawing the line segments connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares. A331452

Number of cells formed by connecting all the 4n points on the perimeter of an n X n square by straight lines; a(0) = 0 by convention. A255011

Triangle of coefficients T(n,k) of xⁿ*y^k in g.f. A(x,y) satisfying y = ∑_n=-oo..+oo (-1)ⁿ * xⁿ * (y·A(x,y) + x^n-1)ⁿ⁺¹. A359670

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 0 2 4 5 7 or 9. A251652

Number of ways to write n as an ordered sum of 7 nonprime numbers. A341484

Riordan's general Eulerian recursion: T(n,k) = (k+2)*T(n-1, k) + (n-k) * T(n-1, k-1), with T(n,0) = 1, T(n,n) = 0. A157012

Linear coefficient (in absolute value) of the quadratic polynomials giving the numbers of 2k-cycles in the n X n grid graph for n >= k-1. A302336

Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of regions in the resulting planar graph. A367323

Smaller side not divisible by 37 of right triangles with integer sides and integer side inscribed squares with two vertices on the hypotenuse. A123697

Number of (n+1) X (2+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250723