Properties of the Number 20293

Twenty Thousand Two Hundred Ninety-Three

Basics

Value: 20292 → 20293 → 20294

Parity: odd

Prime: No

Previous Prime: 20287

Next Prime: 20297

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 7 × 13 × 223

Divisors: 1, 7, 13, 91, 223, 1561, 2899, 20293

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100111101000101

Octal: 47505

Duodecimal: B8B1

Hexadecimal: 4f45

Square: 411805849

Square Root: 142.45350118547455

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 compositions of n with weakly increasing differences. A325546

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0101 0111. A259515

a(n) = a(n-1) + a(n-2) + 2 where a(0) = a(1) = 1. A111314

T(n,k)=Unchanging value maps: number of nXk binary arrays indicating the locations of corresponding elements unequal to no king-move neighbor in a random 0..1 nXk array. A219403

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 parts of p. A241831

a(n) = 21·n⁴ - 36·n³ + 25·n² - 8·n + 1. A239426

Consider triangle in which n-th row contains the smallest set of n consecutive numbers whose LCM is divisible by primorial(n) (the product of first n primes). Sequence contains the first column. A83130

Number T(n,k) of endofunctions on [n] such that at most k elements with nonempty preimage have equal preimage cardinality and non-equinumerous preimages have cardinalities that differ by at least k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A231915

Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k UUDU's starting at level 0. A135330

Diagonal sums of the triangle A132047. A144707