Properties of the Number 20692

Twenty Thousand Six Hundred Ninety-Two

Basics

Value: 20691 → 20692 → 20693

Parity: even

Prime: No

Previous Prime: 20681

Next Prime: 20693

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 7 × 739

Divisors: 1, 2, 4, 7, 14, 28, 739, 1478, 2956, 5173

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101000011010100

Octal: 50324

Duodecimal: BB84

Hexadecimal: 50d4

Square: 428158864

Square Root: 143.8471410908121

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 two-rowed partitions of length 3. A1993

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one. A237332

Least positive integer k such that k·n+1 = prime(p) and k²*n+1 = prime(q) for some pair of primes p and q. A261437

Expansion of ∏_m>=1 (1 - m·q^m)⁷. A22667

Number n such that the sum of its proper evil divisors (A001969) equals n. A230587

Number of (n+1)X(5+1) 0..2 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one. A237329

Triangle read by rows: T(n,k) is the number of free polyforms consisting of k unit square cells and n-k isosceles right triangular cells whose short sides have unit length. Cells are joined along sides of equal lengths. A391193

Number of (n+1)X(1+1) 0..2 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one. A237325

The number of non-equivalent distinguishing colorings of the cycle on n vertices with at most k colors (k>=1). The cycle graph is defined for n>=3; extended to n=1,2 using the closed form. Square array read by descending antidiagonals: the rows are indexed by n, the number of vertices of the cycle and the columns are indexed by k, the number of permissible colors. A309528

Numbers of form 7 x² + 10 y². A20692