Properties of the Number 20263

Twenty Thousand Two Hundred Sixty-Three

Basics

Value: 20262 → 20263 → 20264

Parity: odd

Prime: No

Previous Prime: 20261

Next Prime: 20269

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 23 × 881

Divisors: 1, 23, 881, 20263

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100111100100111

Octal: 47447

Duodecimal: B887

Hexadecimal: 4f27

Square: 410589169

Square Root: 142.3481647229777

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

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

G.f. A(x) equals the limit of the composition of functions (x+xⁿ); let F₁(x) = x, F_n+1(x) = F_n(x+xⁿ⁺¹), then A(x) = limit F_n(x): A(x) = x o x+x² o x+x³ o ... o x+xⁿ o... A119470

L.g.f.: ∑_n>=1 a(n)*xⁿ/n = ∑_n>=1 xⁿ/n·exp( ∑_k>=1 a(k)*x^n·k/k ). A209397

Number of partitions p of n such that (maximal multiplicity of the parts of p) <= (number of distinct parts of p). A240306

Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) > number of distinct parts of p. A241822

Pseudoprimes to base 90. A20218

Strong pseudoprimes to base 32. A20258

a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048212. A48222

Numbers m that are solutions of the arithmetic differential equation 2m" - m' - 4 = 0. A334261

Strong pseudoprimes to base 37. A20263