Properties of the Number 22491

Twenty-Two Thousand Four Hundred Ninety-One

Basics

Value: 22490 → 22491 → 22492

Parity: odd

Prime: No

Previous Prime: 22483

Next Prime: 22501

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 7 ² × 17

Divisors: 1, 3, 7, 9, 17, 21, 27, 49, 51, 63

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101011111011011

Octal: 53733

Duodecimal: 11023

Hexadecimal: 57db

Square: 505845081

Square Root: 149.96999699939985

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)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements equal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..2 order. A223000

a(n) = n²*(5·n-3)/2. A6597

a(n) = (7·n⁴ + 5·n²)/12. A185505

T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements equal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..2 order. A222853

Exponential Riordan array [exp(sinh(x)*exp(x)), sinh(x)*exp(x)]. A154602

Composite numbers k, not squarefree semiprimes, such that k' is a sum of distinct primorial numbers, where k' stands for the arithmetic derivative of k, A003415. A369642

a(n) = A000265(A263931(n)). A356637

a(n) = T(n,2n-4), T given by A027052. A27060

First trisection of A028560. A147651

Number of nX2 0..2 arrays with no more than floor(nX2/2) elements equal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..2 order. A222849