Properties of the Number 22388

Twenty-Two Thousand Three Hundred Eighty-Eight

Basics

Value: 22387 → 22388 → 22389

Parity: even

Prime: No

Previous Prime: 22381

Next Prime: 22391

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 29 × 193

Divisors: 1, 2, 4, 29, 58, 116, 193, 386, 772, 5597

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101011101110100

Octal: 53564

Duodecimal: 10B58

Hexadecimal: 5774

Square: 501222544

Square Root: 149.6262009141447

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

Sorted positions of first appearances in A368109 (number of ways to choose a binary index of each binary index). A368112

T(n,k)=Two-loop graph coloring a rectangular array: number of nXk 0..4 arrays where 0..4 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223255

T(n,k)=3X3X3 triangular graph without horizontal edges coloring a rectangular array: number of nXk 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,2 1,3 1,4 2,4 2,5 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223352

Numbers that are the sum of eight fourth powers in exactly nine ways. A345841

Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 395", based on the 5-celled von Neumann neighborhood. A281750

Numbers k such that the sum of the first k odd primes is divisible by k. A97961

Shifts 3 places left under Dirichlet convolution. A144367

Two-loop graph coloring a rectangular array: number of n X 2 0..4 arrays where 0..4 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223249

Number of -n..n arrays x(0..3) of 4 elements with zero sum and no two neighbors equal. A199706

Two-loop graph coloring a rectangular array: number of nX6 0..4 arrays where 0..4 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223253