Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a3ff604cda804b2a

Jump to content

20,067

From Wikipedia, the free encyclopedia
20066 20067 20068
Cardinaltwenty thousand sixty-seven
Ordinal20067th
(twenty thousand sixty-seventh)
Factorization3 × 6689
Divisors1, 3, 6689, 20067
Greek numeral͵ξζ´
Roman numeralXXLXVII, xxlxvii
Binary1001110011000112
Ternary10001120203
Senary2325236
Octal471438
DuodecimalB74312
Hexadecimal4E6316

20,067 (twenty thousand [and] sixty-seven) is the natural number following 20,066 and preceding 20,068.[1]

In mathematics

[edit]

The prime factorization of 20067 is 3 * 6689, meaning that 20067 is a composite number with 4 divisors being 1, 3, 6689, and 20067.[1] It is a deficient number, because the sum of the divisors (excluding 20067 itself) is 6693, which is less than 20067.[2][1]

Boring number

[edit]

As of September 2026, the number 20067 is a boring number, since it only appears once in the On-Line Encyclopedia of Integer Sequences.[3][4] It is also the smallest one.[5] This definition of uninteresting is possible only because the OEIS lists only a finite number of terms for each entry.[3] Being the smallest uninteresting number is considered interesting.[6]

In the OEIS sequence A379570, 20067 is the number of 5-digit numbers that have exactly 8 divisors.[7]

References

[edit]
  1. 1 2 3 Vanovschi, Vitalii. "Properties of the number 20067". www.numberempire.com. Retrieved 2026-09-17.
  2. "The Positive Integer 20067". www.positiveintegers.org. Retrieved 2026-09-17.
  3. 1 2 Bischoff, Manon. "The Most Boring Number in the World Is ..." Scientific American. Retrieved 2026-09-17.
  4. Sloane, N. J. A. "Search: 20067". The On-Line Encyclopedia of Integer Sequences. Retrieved 2026-09-17.
  5. "Reviews". Mathematics Magazine. 96 (4): 479–480. 2023-08-08. doi:10.1080/0025570X.2023.2234204. ISSN 0025-570X.
  6. Chaitin, Gregory (May 2002). Paradoxes of Randomness (Report). CDMTCS Research Report Series. Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland. CDMTCS-188. Retrieved 2026-09-17.
  7. Sloane, N. J. A. (ed.). "Sequence A379570 (Number of n-digit numbers that have exactly 8 divisors)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.