Live analysis

1,000,396

1,000,396 is a composite number, even.

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,000,396 (one million three hundred ninety-six) is an even 7-digit number. It is a composite number with 12 divisors, and factors as 2² × 383 × 653. Written other ways, in hexadecimal, 0xF43CC.

Arithmetic Number Cube-Free Deficient Number Odious Number Pernicious Number

Interestingness

★ ☆ ☆ ☆ ☆

2 notable facts · grade F

1,000,384 1,000,385 1,000,386 1,000,387 1,000,388 1,000,389 1,000,390 1,000,391 1,000,392 1,000,393 1,000,394 1,000,395 1,000,396 1,000,397 1,000,398 1,000,399 1,000,400 1,000,401 1,000,402 1,000,403 1,000,404 1,000,405 1,000,406 1,000,407 1,000,408

less more

Properties

Parity: Even
Digit count: 7
Digit sum: 19
Digit product: 0
Digital root: 1
Palindrome: No
Bit width: 20 bits
Reversed: 6,930,001
Square (n²): 1,000,792,156,816
Cube (n³): 1,001,188,470,510,099,136
Divisor count: 12
σ(n) — sum of divisors: 1,757,952
φ(n) — Euler's totient: 498,128
Sum of prime factors: 1,040

Primality

Prime factorization: 2 ² × 383 × 653

Nearest primes: 1,000,393 (−3) · 1,000,397 (+1)

Divisors & multiples

All divisors (12)

1 · 2 · 4 · 383 · 653 · 766 · 1306 · 1532 · 2612 · 250099 · 500198 (half) · 1000396

Aliquot sum (sum of proper divisors): 757,556

Factor pairs (a × b = 1,000,396)

1 × 1000396

2 × 500198

4 × 250099

383 × 2612

653 × 1532

766 × 1306

First multiples

1,000,396 · 2,000,792 (double) · 3,001,188 · 4,001,584 · 5,001,980 · 6,002,376 · 7,002,772 · 8,003,168 · 9,003,564 · 10,003,960

Sums & aliquot sequence

As consecutive integers: 125,046 + 125,047 + … + 125,053 2,421 + 2,422 + … + 2,803 1,206 + 1,207 + … + 1,858

Aliquot sequence: 1,000,396 → 757,556 → 568,174 → 338,090 → 270,490 → 260,870 → 233,770 → 193,118 → 98,530 → 82,910 → 66,346 → 49,592 → 43,408 → 40,726 → 29,114 → 14,560 → 27,776 — unresolved within range

Continued fraction of √n

√1,000,396 = [1000; (5, 19, 1, 1, 1, 1, 6, 6, 2, 2, 5, 6, 1, 1, 1, 3, 1, 8, 1, 1, 1, 1, 5, 2, …)]

Representations

In words: one million three hundred ninety-six
Ordinal: 1000396th
Binary: 11110100001111001100
Octal: 3641714
Hexadecimal: 0xF43CC
Base64: D0PM
One's complement: 4,293,966,899 (32-bit)
Scientific notation: 1.000396 × 10⁶
As a duration: 1,000,396 s = 11 days, 13 hours, 53 minutes, 16 seconds

In other bases

ternary (3) 1212211021201

quaternary (4) 3310033030

quinary (5) 224003041

senary (6) 33235244

septenary (7) 11334415

nonary (9) 1784251

undecimal (11) 623681

duodecimal (12) 402b24

tridecimal (13) 290467

tetradecimal (14) 1c080c

pentadecimal (15) 14b631

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

Goldbach decomposition

Goldbach's conjecture says every even integer greater than 2 is the sum of two primes. For 1000396, here are decompositions:

3 + 1000393 = 1000396
29 + 1000367 = 1000396
83 + 1000313 = 1000396
107 + 1000289 = 1000396
197 + 1000199 = 1000396
263 + 1000133 = 1000396
359 + 1000037 = 1000396
443 + 999953 = 1000396

Showing the first eight; more decompositions exist.

Hex color

#0F43CC

RGB(15, 67, 204)

IPv4 address

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

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

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

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,000,396 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,000,396 on Google Patents ↗ Look up on USPTO ↗