Properties of the Number 22098

Twenty-Two Thousand Ninety-Eight

Basics

Value: 22097 → 22098 → 22099

Parity: even

Prime: No

Previous Prime: 22093

Next Prime: 22109

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 29 × 127

Divisors: 1, 2, 3, 6, 29, 58, 87, 127, 174, 254

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101011001010010

Octal: 53122

Duodecimal: 10956

Hexadecimal: 5652

Square: 488321604

Square Root: 148.6539605930498

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

T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6 (constant-stress 1 X 1 tilings). A234823

Number of n X 3 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nonincreasing order. A166830

Square array A(1,k) = A265907(k), A(n>1,k) = A(n-1, k+1) - A(n-1, k); successive differences of A265907 read by descending antidiagonals as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ... A275960

Indices k such that 25 plus the k-th triangular number is a perfect square. A154151

Transpose of array A275960. A275961

First differences of A265908; second differences of A265907. A275963

a(n) is the unique nonnegative integer whose binary expansion is the parity sequence of the Collatz orbit of n, interpreted through a particular conjugacy (see Comments). A389685

Number of (n+1) X (2+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6 (constant-stress 1 X 1 tilings). A234817

Number of (n+1) X (4+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6 (constant-stress 1 X 1 tilings). A234819

Triangle read by rows: T(n,k) = number of cubic graphs with 2n nodes and packing chromatic number k (n>=2, 4 <= k <= n+2). A275622