Properties of the Number 22149

Twenty-Two Thousand One Hundred Forty-Nine

Basics

Value: 22148 → 22149 → 22150

Parity: odd

Prime: No

Previous Prime: 22147

Next Prime: 22153

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 23 × 107

Divisors: 1, 3, 9, 23, 69, 107, 207, 321, 963, 2461

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101011010000101

Octal: 53205

Duodecimal: 10999

Hexadecimal: 5685

Square: 490578201

Square Root: 148.82540105774956

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

E.g.f. S(x,y) = Integral C(x,y)*C(y,x) dx such that C(x,y)² - S(x,y)² = 1 and C(y,x) = 1 + Integral S(y,x)*C(x,y) dy, where S(x,y) = ∑_n>=0 ∑_k=0..n T(n,k) * x^2·n+1-2·k*y^2·k/((2·n+1-2·k)!*(2·k)!), as a triangle of coefficients T(n,k) read by rows. A322220

Starting numbers for which the RATS sequence has eventual period 3. A114613

E.g.f. A(x) satisfies: A'(x) = A(x·A'(x)²) with A(0)=1. A231866

a(n) = ∑_k=1..n (-1)^k+1 * floor(n/k)³. A344721

E.g.f. S(x,y) = Integral C(x,y)*C(y,x) dx such that C(x,y)² + S(x,y)² = 1 and C(y,x) = 1 - Integral S(y,x)*C(x,y) dy, as a triangle of coefficients T(n,k) read by rows. A367380

Least multiple of 2n-1 ending in prime(n), 0 if no such number exists. A114780

Number of partitions of n with at most four part sizes. A364793

Number of essentially different semi-magic squares of order 3 with semimagic sum n. A122751

Number of nX2 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and every element equal to zero or two horizontal or vertical neighbors. A199240

Number of n X 3 nonnegative integer arrays with upper left 0 and every value within 2 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down. A252831