Properties of the Number 22384

Twenty-Two Thousand Three Hundred Eighty-Four

Basics

Value: 22383 → 22384 → 22385

Parity: even

Prime: No

Previous Prime: 22381

Next Prime: 22391

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ⁴ × 1399

Divisors: 1, 2, 4, 8, 16, 1399, 2798, 5596, 11192, 22384

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101011101110000

Octal: 53560

Duodecimal: 10B54

Hexadecimal: 5770

Square: 501043456

Square Root: 149.61283367412034

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 partitions of 2n - 1 with the same length as alternating sum. A357488

Number of integer partitions of n with the same length as reverse-alternating sum. A357487

Number of triangles in the graph formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares). A332606

Total number of round trips of length n on the closed Laguerre graph Lc₄ divided by 4. A201200

Expansion of f(x³, x⁹) * f(x⁶, x⁶) / f(-x, -x²) in powers of·where f(,) is Ramanujan's general θ function. A257655

Irregular triangle read by rows: consider the structure formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of an (n+1) X 3 rectangular grid of points (or equally, an n X 2 grid of squares); row n gives number of cells with k sides, for k >= 3. A335701

a(n) is the Wiener index of a broom on 2n vertices of which n+2 are pendant. A349416

Number of length n+7 0..1 arrays with at most one downstep in every n consecutive neighbor pairs. A255998

Numbers k such that (38·10^k + 691)/9 is prime. A290476

If n is of the form p^p, a(n) = 0, otherwise a(n) gives the number of iterations of x -> A003415(x) needed to reach the first number different from n which is either a prime, or whose degree (A051903) differs from the degree of n. If the degree of the final number is <= that of n, then a(n) = -1·iteration count. A328384