Properties of the Number 20094

Twenty Thousand Ninety-Four

Basics

Value: 20093 → 20094 → 20095

Parity: even

Prime: No

Previous Prime: 20089

Next Prime: 20101

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 17 × 197

Divisors: 1, 2, 3, 6, 17, 34, 51, 102, 197, 394

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 100111001111110

Octal: 47176

Duodecimal: B766

Hexadecimal: 4e7e

Square: 403768836

Square Root: 141.7533068397348

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

Convolution of A006068 (inverse of Gray code) with itself: a(n) = ∑_k=1..n+1 A006068(k) * A006068(1+n-k). A268721

Number of nondecreasing arrangements of n numbers in -7..7 with sum zero. A183915

Smallest number that requires n steps to reach 0 when iterating the mapping k -> abs(reverse(lpd(k))-reverse(Lpf(k))). lpd(k) is the largest proper divisor and Lpf(k) is the largest prime factor of k. A76424

Number of strictly increasing arrangements of n numbers in -(n+2)..(n+2) with sum zero. A188176

O.g.f. A(x) satisfies: [xⁿ] exp( n*(n+1) * x·A(x)⁷ ) / A(x)ⁿ⁺¹ = 0 for n > 0. A393628

T(n,k) is the number of strictly increasing arrangements of n numbers in -(n+k-2)..(n+k-2) with sum zero. A188181

G.f.: A(x) = 1 + x*(1 + x*(1 + x*(...(1 + x*(...)³ⁿ)...)⁹)⁶)³. A138213

T(n,k) = number of nondecreasing arrangements of n numbers in -k..k with sum zero. A183917

a(n) = (1/5ⁿ) * ∑_k=0..n² ( (binomial(n², k) * 4^k) (mod 5ⁿ) ). A376534

T(n,k)=Number of nXk 0..1 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other. A201503