Live analysis

1,020,605

1,020,605 is a composite number, odd.

This number doesn't have a permanent NumberWiki page yet — what you see below is computed live. Pages get added to the permanent index when they're notable (years, primes, curated, etc.).

1,020,605 (one million twenty thousand six hundred five) is an odd 7-digit number. It is a composite number with 16 divisors, and factors as 5 × 43 × 47 × 101. Written other ways, in hexadecimal, 0xF92BD.

Arithmetic Number Cube-Free Deficient Number Odious Number Pernicious Number Self Number Squarefree

Interestingness

★ ★ ☆ ☆ ☆

4 notable facts · grade D

1,020,593 1,020,594 1,020,595 1,020,596 1,020,597 1,020,598 1,020,599 1,020,600 1,020,601 1,020,602 1,020,603 1,020,604 1,020,605 1,020,606 1,020,607 1,020,608 1,020,609 1,020,610 1,020,611 1,020,612 1,020,613 1,020,614 1,020,615 1,020,616 1,020,617

less more

Properties

Parity: Odd
Digit count: 7
Digit sum: 14
Digit product: 0
Digital root: 5
Palindrome: No
Bit width: 20 bits
Reversed: 5,060,201
Square (n²): 1,041,634,566,025
Cube (n³): 1,063,097,446,257,945,125
Divisor count: 16
σ(n) — sum of divisors: 1,292,544
φ(n) — Euler's totient: 772,800
Sum of prime factors: 196

Primality

Prime factorization: 5 × 43 × 47 × 101

Nearest primes: 1,020,599 (−6) · 1,020,619 (+14)

Divisors & multiples

All divisors (16)

1 · 5 · 43 · 47 · 101 · 215 · 235 · 505 · 2021 · 4343 · 4747 · 10105 · 21715 · 23735 · 204121 · 1020605

Aliquot sum (sum of proper divisors): 271,939

Factor pairs (a × b = 1,020,605)

1 × 1020605

5 × 204121

43 × 23735

47 × 21715

101 × 10105

215 × 4747

235 × 4343

505 × 2021

First multiples

1,020,605 · 2,041,210 (double) · 3,061,815 · 4,082,420 · 5,103,025 · 6,123,630 · 7,144,235 · 8,164,840 · 9,185,445 · 10,206,050

Sums & aliquot sequence

As consecutive integers: 510,302 + 510,303 204,119 + 204,120 + 204,121 + 204,122 + 204,123 102,056 + 102,057 + … + 102,065 23,714 + 23,715 + … + 23,756

Aliquot sequence: 1,020,605 → 271,939 → 1 → 0 — terminates at zero

Continued fraction of √n

√1,020,605 = [1010; (4, 2020)]

Period length 2 — the block in parentheses repeats forever.

Representations

In words: one million twenty thousand six hundred five
Ordinal: 1020605th
Binary: 11111001001010111101
Octal: 3711275
Hexadecimal: 0xF92BD
Base64: D5K9
One's complement: 4,293,946,690 (32-bit)
Scientific notation: 1.020605 × 10⁶
As a duration: 1,020,605 s = 11 days, 19 hours, 30 minutes, 5 seconds

In other bases

ternary (3) 1220212000012

quaternary (4) 3321022331

quinary (5) 230124410

senary (6) 33513005

septenary (7) 11450345

nonary (9) 1825005

undecimal (11) 637883

duodecimal (12) 412765

tridecimal (13) 299711

tetradecimal (14) 1c7d25

pentadecimal (15) 152605

As an angle

1,020,605° = 2,835 × 360° + 5°

5° ≈ 0.087 rad

Compass bearing: N (north)

Why does a circle have 360 degrees? →

Historical numeral systems

Babylonian (base 60): 𒁹𒁹𒁹𒁹 𒌋𒌋𒌋𒌋𒁹𒁹𒁹 𒌋𒌋𒌋 𒁹𒁹𒁹𒁹𒁹
Egyptian hieroglyphic: 𓁨𓂍𓂍𓍢𓍢𓍢𓍢𓍢𓍢𓏺𓏺𓏺𓏺𓏺
Chinese: 一百零二萬零六百零五
Chinese (financial): 壹佰零貳萬零陸佰零伍

In other modern scripts

Eastern Arabic ١٠٢٠٦٠٥ Devanagari १०२०६०५ Bengali ১০২০৬০৫ Tamil ௧௦௨௦௬௦௫ Thai ๑๐๒๐๖๐๕ Tibetan ༡༠༢༠༦༠༥ Khmer ១០២០៦០៥ Lao ໑໐໒໐໖໐໕ Burmese ၁၀၂၀၆၀၅

Also seen as

Hex color

#0F92BD

RGB(15, 146, 189)

IPv4 address

As an unsigned 32-bit integer, this is the IPv4 address 0.15.146.189.

Address: 0.15.146.189
Class: reserved
IPv4-mapped IPv6: ::ffff:0.15.146.189

Unspecified address (0.0.0.0/8) — "this network" placeholder.

Possible date

Could be parsed as a date. Most likely interpretation: Wednesday, January 2, 0605 (MDDYYYY (US, single-digit month)).

Other possible interpretations (3)

0605-02-01 (DMMYYYY (Euro, single-digit day))
0605-10-02 (MMDYYYY (US, single-digit day))
0605-02-10 (DDMYYYY (Euro, single-digit month))

Possible US patent number

This number falls in the range of US utility patent numbers. If it's a patent, it would be issued as US 1,020,605 and was likely granted around 1911.

Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.

Look up US1,020,605 on Google Patents ↗ Look up on USPTO ↗