Properties of the Number 20044

Twenty Thousand Forty-Four

Basics

Value: 20043 → 20044 → 20045

Parity: even

Prime: No

Previous Prime: 20029

Next Prime: 20047

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 5011

Divisors: 1, 2, 4, 5011, 10022, 20044

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 100111001001100

Octal: 47114

Duodecimal: B724

Hexadecimal: 4e4c

Square: 401761936

Square Root: 141.57683426323672

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

Number of integer partitions of n such that, for all parts x, x - 1 or x + 1 is also a part. A355394

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A299567

Least number of consecutive primes beginning with 2, the sum of which (A007504) is >= 2ⁿ. A323360

Number of nX4 0..1 arrays with every element equal to 1, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A299563

Number of nX6 0..1 arrays with every element equal to 1, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A299565

Numbers n such that the number formed by the digits of 2n sorted in ascending order is equal to the sum of the divisors of n after the digits of each divisor have been sorted in ascending order. A83387

Number of (undirected) paths in the n-book graph. A307921

a(n) = round(γ(n+1/3)/γ(1/3)). A20044