Properties of the Number 22442

Twenty-Two Thousand Four Hundred Forty-Two

Basics

Value: 22441 → 22442 → 22443

Parity: even

Prime: No

Previous Prime: 22441

Next Prime: 22447

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 7 ² × 229

Divisors: 1, 2, 7, 14, 49, 98, 229, 458, 1603, 3206

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 101011110101010

Octal: 53652

Duodecimal: 10BA2

Hexadecimal: 57aa

Square: 503643364

Square Root: 149.80654191322887

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 n such that it is not possible to choose a different constant integer partition of each part. A387329

Total sum of even parts in all partitions of n. A66966

Numbers with digits 2 and 4 only. A284920

Triangle of coefficients of polynomials u(n,x) jointly generated with A209696; see the Formula section. A209695

Consider the graph with one central vertex connected to three outer vertices (a star graph). Then, a(n) is the minimum number of moves required to transfer a stack of n pegs from one outer vertex to another outer vertex, moving pegs to adjacent vertices, following the rules of the Towers of Hanoi. A291876

Indices of primes in sequence defined by A(0) = 13, A(n) = 10·A(n-1) + 33 for n > 0. A102023

Number of equivalence classes of Boolean functions, that is, maps from GF(2)ⁿ to GF(2), where maps f and g are equivalent iff one can be obtained from the other by a combination of (i) permuting the variables, (ii) complementing the variables, (iii) mapping f(x) to f(x) + b.x + c for a binary vector b and a binary scalar c. A109003

Expansion of g.f. A(x) satisfying A(x)² = A(x·A(x)) / (1-x) with A(0) = 0. A367387

a(n) = c(n) + c(n-1) where c is the sequence of numbers not in a. A22442

Number of 5X(n+1) 0..2 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors. A205740