Properties of the Number 22804

Twenty-Two Thousand Eight Hundred Four

Basics

Value: 22803 → 22804 → 22805

Parity: even

Prime: No

Previous Prime: 22787

Next Prime: 22807

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 5701

Divisors: 1, 2, 4, 5701, 11402, 22804

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101100100010100

Octal: 54424

Duodecimal: 11244

Hexadecimal: 5914

Square: 520022416

Square Root: 151.00993344810135

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

Number of integer points in the convex hull in Rⁿ of parking functions of length n. A333331

Sequence of numerators of the continued fraction derived from the sequence of the number of distinct factors of a number (A001221, also called ω(n)). A112595

Sum of the next n positive integers repeated (A008619). A319006

a(n) is the least k >= 1 such that n + k² is the digit reversal of a square. A393287

Number of trees on n nodes with forbidden limbs. A14271

Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k peaks.The members of L_n are paths of weight n that start at (0,0), end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. A peak is a (1,1)-step followed by a (1,-1)-step. A182903

Number of distinct products of distinct factorials up to n!. A255937

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 419", based on the 5-celled von Neumann neighborhood. A272047

Number of Grassmannian permutations of size n that avoid a pattern, σ, where σ is a pattern of size 9 with exactly one descent. A362196

a(n) = B(n) + c(n) where B(n) is Beatty sequence [ n·sqrt(2) ] and c is the complement of B. A22804