Properties of the Number 20049

Twenty Thousand Forty-Nine

Basics

Value: 20048 → 20049 → 20050

Parity: odd

Prime: No

Previous Prime: 20047

Next Prime: 20051

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 41 × 163

Divisors: 1, 3, 41, 123, 163, 489, 6683, 20049

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 100111001010001

Octal: 47121

Duodecimal: B729

Hexadecimal: 4e51

Square: 401962401

Square Root: 141.59449141827517

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

Numbers k for which A354102(k) = A354102(σ(k)). A354106

a(n) = n*(2·n² + 1)*(n² + 1)/6. A52459

Number of (w,x,y) with all terms in {0,...,n} and |w-x| + |x-y| > w+x+y. A213482

Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of these n·k points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of regions in the resulting planar graph. A367304

a(n) = ∑_k=0..n 4^k * binomial(n,k) * binomial(n+3,k). A388206

Expansion of 1/((1-x)³ (1-x²)² (1-x³) (1-x⁴)). A2626

Row sums of triangle A145370 (S1hat(-4)) and partition array A145359 (M31hat(-4)). A145371

Positions of highly powerful numbers in the EKG sequence. A141422

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, -1, 0), (0, 1, -1), (1, 1, 1)}. A149681

Number of UH^jU's, DH^jD's, and DH^jU's for some j>0, in all peakless Motzkin paths of length n (here U=(1,1), D=(1,-1) and H=(1,0); can be easily expressed using RNA secondary structure terminology). A187259