Properties of the Number 20848

Twenty Thousand Eight Hundred Forty-Eight

Basics

Value: 20847 → 20848 → 20849

Parity: even

Prime: No

Previous Prime: 20809

Next Prime: 20849

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ⁴ × 1303

Divisors: 1, 2, 4, 8, 16, 1303, 2606, 5212, 10424, 20848

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101000101110000

Octal: 50560

Duodecimal: 10094

Hexadecimal: 5170

Square: 434639104

Square Root: 144.38836518224036

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

a(n) is the numerator of the expected depth of the tree representing the process of eliminating from n people a random group by tossing coins, and repeating this process recursively until a single loser is determined. A372422

Number of connected oriented graphs (i.e., connected directed graphs with no bidirected edges) on n nodes. A86345

Consider the Diophantine equation x³ + y³ = z³ + 1 (1 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791). Sequence gives values of x. A50792

Positive integers of the form (7·m²+1)/11. A179370

Expansion of ∏_k>=0 ((1+x^3·k+1)/(1-x^3·k+1))². A261649

Triangle read by rows: Number of oriented graphs on n nodes with k components. A281446

Starting from generation 7 add previous and next term yielding generation 8. A48454

Triangle read by rows: Kreweras's "Rule A₄ left thickness" numbers. A259099

a(n) = prime(n) + prime(n+1) * prime(n+2). A293206

Numbers k such that there is no prime p and index j > k such that A002182(j) = p·A002182(k). A309042