Live analysis

505,990

505,990 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.).

505,990 (five hundred five thousand nine hundred ninety) is an even 6-digit number. It is a composite number with 8 divisors, and factors as 2 × 5 × 50,599. Written other ways, in hexadecimal, 0x7B886.

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

Interestingness

★ ★ ☆ ☆ ☆

4 notable facts · grade D

505,978 505,979 505,980 505,981 505,982 505,983 505,984 505,985 505,986 505,987 505,988 505,989 505,990 505,991 505,992 505,993 505,994 505,995 505,996 505,997 505,998 505,999 506,000 506,001 506,002

less more

Properties

Parity: Even
Digit count: 6
Digit sum: 28
Digit product: 0
Digital root: 1
Palindrome: No
Bit width: 19 bits
Reversed: 99,505
Square (n²): 256,025,880,100
Cube (n³): 129,546,535,071,799,000
Divisor count: 8
σ(n) — sum of divisors: 910,800
φ(n) — Euler's totient: 202,392
Sum of prime factors: 50,606

Primality

Prime factorization: 2 × 5 × 50599

Nearest primes: 505,979 (−11) · 506,047 (+57)

Divisors & multiples

All divisors (8)

1 · 2 · 5 · 10 · 50599 · 101198 · 252995 (half) · 505990

Aliquot sum (sum of proper divisors): 404,810

Factor pairs (a × b = 505,990)

1 × 505990

2 × 252995

5 × 101198

10 × 50599

First multiples

505,990 · 1,011,980 (double) · 1,517,970 · 2,023,960 · 2,529,950 · 3,035,940 · 3,541,930 · 4,047,920 · 4,553,910 · 5,059,900

Sums & aliquot sequence

As consecutive integers: 126,496 + 126,497 + 126,498 + 126,499 101,196 + 101,197 + 101,198 + 101,199 + 101,200 25,290 + 25,291 + … + 25,309

Aliquot sequence: 505,990 → 404,810 → 428,086 → 214,046 → 152,914 → 79,034 → 42,406 → 36,218 → 30,982 → 22,154 → 16,726 → 8,366 → 4,594 → 2,300 → 2,908 → 2,188 → 1,648 — unresolved within range

Continued fraction of √n

√505,990 = [711; (3, 30, 1, 1, 2, 6, 2, 2, 4, 2, 3, 4, 4, 2, 2, 2, 12, 15, 1, 1, 4, 4, 1, 3, …)]

Representations

In words: five hundred five thousand nine hundred ninety
Ordinal: 505990th
Binary: 1111011100010000110
Octal: 1734206
Hexadecimal: 0x7B886
Base64: B7iG
One's complement: 4,294,461,305 (32-bit)
Scientific notation: 5.0599 × 10⁵
As a duration: 505,990 s = 5 days, 20 hours, 33 minutes, 10 seconds

In other bases

ternary (3) 221201002101

quaternary (4) 1323202012

quinary (5) 112142430

senary (6) 14502314

septenary (7) 4205122

nonary (9) 851071

undecimal (11) 316181

duodecimal (12) 20499a

tridecimal (13) 149404

tetradecimal (14) d2582

pentadecimal (15) 9edca

As an angle

505,990° = 1,405 × 360° + 190°

190° ≈ 3.316 rad

Compass bearing: S (south)

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 505990, here are decompositions:

11 + 505979 = 505990
29 + 505961 = 505990
41 + 505949 = 505990
71 + 505919 = 505990
83 + 505907 = 505990
113 + 505877 = 505990
167 + 505823 = 505990
179 + 505811 = 505990

Showing the first eight; more decompositions exist.

Hex color

#07B886

RGB(7, 184, 134)

IPv4 address

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

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

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 505,990 and was likely granted around 1893.

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

Look up US505,990 on Google Patents ↗ Look up on USPTO ↗