number.wiki
Live analysis

1,064,805

1,064,805 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,064,805 (one million sixty-four thousand eight hundred five) is an odd 7-digit number. It is a composite number with 16 divisors, and factors as 3 × 5 × 7 × 10,141. Written other ways, in hexadecimal, 0x103F65.

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

Interestingness

Properties

Parity
Odd
Digit count
7
Digit sum
24
Digit product
0
Digital root
6
Palindrome
No
Bit width
21 bits
Reversed
5,084,601
Square (n²)
1,133,809,688,025
Cube (n³)
1,207,286,224,857,460,125
Divisor count
16
σ(n) — sum of divisors
1,947,264
φ(n) — Euler's totient
486,720
Sum of prime factors
10,156

Primality

Prime factorization: 3 × 5 × 7 × 10141

Nearest primes: 1,064,801 (−4) · 1,064,813 (+8)

Divisors & multiples

All divisors (16)
1 · 3 · 5 · 7 · 15 · 21 · 35 · 105 · 10141 · 30423 · 50705 · 70987 · 152115 · 212961 · 354935 · 1064805
Aliquot sum (sum of proper divisors): 882,459
Factor pairs (a × b = 1,064,805)
1 × 1064805
3 × 354935
5 × 212961
7 × 152115
15 × 70987
21 × 50705
35 × 30423
105 × 10141
First multiples
1,064,805 · 2,129,610 (double) · 3,194,415 · 4,259,220 · 5,324,025 · 6,388,830 · 7,453,635 · 8,518,440 · 9,583,245 · 10,648,050

Sums & aliquot sequence

As consecutive integers: 532,402 + 532,403 354,934 + 354,935 + 354,936 212,959 + 212,960 + 212,961 + 212,962 + 212,963 177,465 + 177,466 + 177,467 + 177,468 + 177,469 + 177,470
Aliquot sequence: 1,064,805 → 882,459 → 411,093 → 182,721 → 129,183 → 55,017 → 24,465 → 20,463 → 8,337 → 4,399 → 137 → 1 → 0 — terminates at zero

Continued fraction of √n

√1,064,805 = [1031; (1, 8, 2, 2, 1, 3, 1, 12, 2, 3, 1, 3, 1, 1, 1, 1, 7, 1, 1, 1, 1, 2, 2, 4, …)]

Representations

In words
one million sixty-four thousand eight hundred five
Ordinal
1064805th
Binary
100000011111101100101
Octal
4037545
Hexadecimal
0x103F65
Base64
ED9l
One's complement
4,293,902,490 (32-bit)
Scientific notation
1.064805 × 10⁶
As a duration
1,064,805 s = 12 days, 7 hours, 46 minutes, 45 seconds
In other bases
ternary (3) 2000002122020
quaternary (4) 10003331211
quinary (5) 233033210
senary (6) 34453353
septenary (7) 12023250
nonary (9) 2002566
undecimal (11) 668005
duodecimal (12) 434259
tridecimal (13) 2b3881
tetradecimal (14) 1da097
pentadecimal (15) 160770

As an angle

1,064,805° = 2,957 × 360° + 285°
285° ≈ 4.974 rad
Compass bearing: WNW (west-northwest)

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
#103F65
RGB(16, 63, 101)
IPv4 address

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

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

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

Possible date

Could be parsed as a date. Most likely interpretation: Thursday, January 6, 4805 (MDDYYYY (US, single-digit month)).

Other possible interpretations (3)
  • 4805-06-01 (DMMYYYY (Euro, single-digit day))
  • 4805-10-06 (MMDYYYY (US, single-digit day))
  • 4805-06-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,064,805 and was likely granted around 1913.

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

Position in π

The digit sequence 1064805 first appears in π at position 427,389 of the decimal expansion (the 427,389ordinal-suffix:th digit after the integer 3).

Search range: the first 1,000,000 fractional digits of π. Any 6-digit-or-shorter string is virtually guaranteed to appear in there — the more interesting signal is the position.

Related reading