490,755
490,755 is a composite number, odd.
490,755 (four hundred ninety thousand seven hundred fifty-five) is an odd 6-digit number. It is a composite number with 8 divisors, and factors as 3 × 5 × 32,717. Written other ways, in hexadecimal, 0x77D03.
Interestingness
Properties
- Parity
- Odd
- Digit count
- 6
- Digit sum
- 30
- Digit product
- 0
- Digital root
- 3
- Palindrome
- No
- Bit width
- 19 bits
- Reversed
- 557,094
- Square (n²)
- 240,840,470,025
- Cube (n³)
- 118,193,664,867,118,875
- Divisor count
- 8
- σ(n) — sum of divisors
- 785,232
- φ(n) — Euler's totient
- 261,728
- Sum of prime factors
- 32,725
Primality
Prime factorization: 3 × 5 × 32717
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√490,755 = [700; (1, 1, 5, 1, 8, 1, 3, 233, 3, 1, 8, 1, 5, 1, 1, 1400)]
Period length 16 — the block in parentheses repeats forever.
Representations
- In words
- four hundred ninety thousand seven hundred fifty-five
- Ordinal
- 490755th
- Binary
- 1110111110100000011
- Octal
- 1676403
- Hexadecimal
- 0x77D03
- Base64
- B30D
- One's complement
- 4,294,476,540 (32-bit)
- Scientific notation
- 4.90755 × 10⁵
- As a duration
- 490,755 s = 5 days, 16 hours, 19 minutes, 15 seconds
As an angle
Historical numeral systems
- Babylonian (base 60)
- 𒁹𒁹 𒌋𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒁹𒁹𒁹𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒁹𒁹𒁹𒁹𒁹
- Egyptian hieroglyphic
- 𓆐𓆐𓆐𓆐𓂍𓂍𓂍𓂍𓂍𓂍𓂍𓂍𓂍𓍢𓍢𓍢𓍢𓍢𓍢𓍢𓎆𓎆𓎆𓎆𓎆𓏺𓏺𓏺𓏺𓏺
- Greek (Milesian)
- ͵υϟψνεʹ
- Chinese
- 四十九萬零七百五十五
- Chinese (financial)
- 肆拾玖萬零柒佰伍拾伍
Also seen as
As an unsigned 32-bit integer, this is the IPv4 address 0.7.125.3.
- Address
- 0.7.125.3
- Class
- reserved
- IPv4-mapped IPv6
- ::ffff:0.7.125.3
Unspecified address (0.0.0.0/8) — "this network" placeholder.
This number falls in the range of US utility patent numbers. If it's a patent, it would be issued as US 490,755 and was likely granted around 1892.
Patent numbers below 100,000 are excluded as too ambiguous; modern numbering currently reaches roughly 12.5 million.
The digit sequence 490755 first appears in π at position 19,992 of the decimal expansion (the 19,992ordinal-suffix:nd 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
- Egyptian hieroglyphic numerals — Seven hieroglyphs for every power of ten, from a single stroke to a million.