Properties of the Number 22458

Twenty-Two Thousand Four Hundred Fifty-Eight

Basics

Value: 22457 → 22458 → 22459

Parity: even

Prime: No

Previous Prime: 22453

Next Prime: 22469

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 19 × 197

Divisors: 1, 2, 3, 6, 19, 38, 57, 114, 197, 394

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101011110111010

Octal: 53672

Duodecimal: 10BB6

Hexadecimal: 57ba

Square: 504361764

Square Root: 149.85993460561767

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

25-gonal pyramidal numbers: a(n) = n*(n+1)*(23·n-20)/6. A256645

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 3 (constant-stress 1 X 1 tilings). A234555

Irregular triangle read by rows: T(n,k) is the sum of the widths of the free polyominoes with n cells and width k, n >= 1, 1 <= k <= ceiling(n/2). A379637

Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 10 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 1, s(2n+1) = 6. A94788

Terms in A112039 that are divisible by 3, divided by 3. A112040

Expansion of (1/x) * Series_Reversion( x * ((1-x)²-x⁴) ). A369160

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 3 (constant-stress 1 X 1 tilings). A234551

a(1)=1 then a(n)= (1/2) *(5·a(n-1)+1) if a(n-1) is odd, a(n)=3/2·a(n-1) otherwise. A86813

Square array T, read by antidiagonals: T(n,k) = 0 if n-k >=4 or if k-n >= 6, T(3,0) = T(2,0) = T(1,0) = T(0,0) = T(0,1) = T(0,2) = T(0,3) = T(0,4) = T(0,5) = 1, T(n,k) = T(n-1,k) + T(n,k-1). A217770

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 nXk array. A219502