Live analysis

466,606

466,606 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.).

466,606 (four hundred sixty-six thousand six hundred six) is an even 6-digit number. It is a composite number with 8 divisors, and factors as 2 × 7 × 33,329. Written other ways, in hexadecimal, 0x71EAE.

Arithmetic Number Cube-Free Deficient Number Evil Number Sphenic Number Squarefree

Interestingness

★ ★ ☆ ☆ ☆

4 notable facts · grade D

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

less more

Properties

Parity: Even
Digit count: 6
Digit sum: 28
Digit product: 0
Digital root: 1
Palindrome: No
Bit width: 19 bits
Reversed: 606,664
Square (n²): 217,721,159,236
Cube (n³): 101,589,999,226,473,016
Divisor count: 8
σ(n) — sum of divisors: 799,920
φ(n) — Euler's totient: 199,968
Sum of prime factors: 33,338

Primality

Prime factorization: 2 × 7 × 33329

Nearest primes: 466,603 (−3) · 466,619 (+13)

Divisors & multiples

All divisors (8)

1 · 2 · 7 · 14 · 33329 · 66658 · 233303 (half) · 466606

Aliquot sum (sum of proper divisors): 333,314

Factor pairs (a × b = 466,606)

1 × 466606

2 × 233303

7 × 66658

14 × 33329

First multiples

466,606 · 933,212 (double) · 1,399,818 · 1,866,424 · 2,333,030 · 2,799,636 · 3,266,242 · 3,732,848 · 4,199,454 · 4,666,060

Sums & aliquot sequence

As consecutive integers: 116,650 + 116,651 + 116,652 + 116,653 66,655 + 66,656 + … + 66,661 16,651 + 16,652 + … + 16,678

Aliquot sequence: 466,606 → 333,314 → 166,660 → 210,836 → 158,134 → 93,074 → 47,866 → 40,838 → 29,194 → 18,614 → 10,114 → 6,266 → 3,898 → 1,952 → 1,954 → 980 → 1,414 — unresolved within range

Continued fraction of √n

√466,606 = [683; (11, 1, 2, 11, 1, 1, 1, 3, 1, 2, 8, 4, 3, 2, 11, 1, 6, 1, 43, 5, 10, 1, 1, 1, …)]

Representations

In words: four hundred sixty-six thousand six hundred six
Ordinal: 466606th
Binary: 1110001111010101110
Octal: 1617256
Hexadecimal: 0x71EAE
Base64: Bx6u
One's complement: 4,294,500,689 (32-bit)
Scientific notation: 4.66606 × 10⁵
As a duration: 466,606 s = 5 days, 9 hours, 36 minutes, 46 seconds

In other bases

ternary (3) 212201001201

quaternary (4) 1301322232

quinary (5) 104412411

senary (6) 14000114

septenary (7) 3652240

nonary (9) 781051

undecimal (11) 299628

duodecimal (12) 1a603a

tridecimal (13) 1344ca

tetradecimal (14) c2090

pentadecimal (15) 933c1

As an angle

466,606° = 1,296 × 360° + 46°

46° ≈ 0.803 rad

Compass bearing: NE (northeast)

Why does a circle have 360 degrees? →

Historical numeral systems

Babylonian (base 60): 𒁹𒁹 𒁹𒁹𒁹𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹
Egyptian hieroglyphic: 𓆐𓆐𓆐𓆐𓂍𓂍𓂍𓂍𓂍𓂍𓆼𓆼𓆼𓆼𓆼𓆼𓍢𓍢𓍢𓍢𓍢𓍢𓏺𓏺𓏺𓏺𓏺𓏺
Greek (Milesian): ͵υξϛχϛʹ
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 466606, here are decompositions:

3 + 466603 = 466606
53 + 466553 = 466606
59 + 466547 = 466606
89 + 466517 = 466606
197 + 466409 = 466606
233 + 466373 = 466606
359 + 466247 = 466606
467 + 466139 = 466606

Showing the first eight; more decompositions exist.

Hex color

#071EAE

RGB(7, 30, 174)

IPv4 address

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

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

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 466,606 and was likely granted around 1891.

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

Look up US466,606 on Google Patents ↗ Look up on USPTO ↗