Live analysis

130,670

130,670 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.).

130,670 (one hundred thirty thousand six hundred seventy) is an even 6-digit number. It is a composite number with 16 divisors, and factors as 2 × 5 × 73 × 179. Written other ways, in hexadecimal, 0x1FE6E.

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

Interestingness

★ ★ ☆ ☆ ☆

4 notable facts · grade D

130,658 130,659 130,660 130,661 130,662 130,663 130,664 130,665 130,666 130,667 130,668 130,669 130,670 130,671 130,672 130,673 130,674 130,675 130,676 130,677 130,678 130,679 130,680 130,681 130,682

less more

Properties

Parity: Even
Digit count: 6
Digit sum: 17
Digit product: 0
Digital root: 8
Palindrome: No
Bit width: 17 bits
Reversed: 76,031
Square (n²): 17,074,648,900
Cube (n³): 2,231,144,371,763,000
Divisor count: 16
σ(n) — sum of divisors: 239,760
φ(n) — Euler's totient: 51,264
Sum of prime factors: 259

Primality

Prime factorization: 2 × 5 × 73 × 179

Nearest primes: 130,657 (−13) · 130,681 (+11)

Divisors & multiples

All divisors (16)

1 · 2 · 5 · 10 · 73 · 146 · 179 · 358 · 365 · 730 · 895 · 1790 · 13067 · 26134 · 65335 (half) · 130670

Aliquot sum (sum of proper divisors): 109,090

Factor pairs (a × b = 130,670)

1 × 130670

2 × 65335

5 × 26134

10 × 13067

73 × 1790

146 × 895

179 × 730

358 × 365

First multiples

130,670 · 261,340 (double) · 392,010 · 522,680 · 653,350 · 784,020 · 914,690 · 1,045,360 · 1,176,030 · 1,306,700

Sums & aliquot sequence

As consecutive integers: 32,666 + 32,667 + 32,668 + 32,669 26,132 + 26,133 + 26,134 + 26,135 + 26,136 6,524 + 6,525 + … + 6,543 1,754 + 1,755 + … + 1,826

Aliquot sequence: 130,670 → 109,090 → 87,290 → 102,790 → 92,330 → 97,750 → 104,426 → 74,614 → 37,310 → 47,362 → 39,038 → 20,362 → 10,184 → 10,216 → 8,954 → 6,208 → 6,238 — unresolved within range

Continued fraction of √n

√130,670 = [361; (2, 14, 3, 1, 12, 2, 1, 1, 3, 1, 1, 1, 9, 1, 1, 5, 2, 4, 1, 1, 8, 1, 1, 1, …)]

Representations

In words: one hundred thirty thousand six hundred seventy
Ordinal: 130670th
Binary: 11111111001101110
Octal: 377156
Hexadecimal: 0x1FE6E
Base64: Af5u
One's complement: 4,294,836,625 (32-bit)
Scientific notation: 1.3067 × 10⁵
As a duration: 130,670 s = 1 day, 12 hours, 17 minutes, 50 seconds

In other bases

ternary (3) 20122020122

quaternary (4) 133321232

quinary (5) 13140140

senary (6) 2444542

septenary (7) 1052651

nonary (9) 218218

undecimal (11) 8a1a1

duodecimal (12) 63752

tridecimal (13) 47627

tetradecimal (14) 35898

pentadecimal (15) 28ab5

Historical numeral systems

Babylonian (base 60): 𒌋𒌋𒌋𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒁹𒁹𒁹𒁹𒁹𒁹𒁹 𒌋𒌋𒌋𒌋𒌋
Egyptian hieroglyphic: 𓆐𓂍𓂍𓂍𓍢𓍢𓍢𓍢𓍢𓍢𓎆𓎆𓎆𓎆𓎆𓎆𓎆
Greek (Milesian): ͵ρλχοʹ
Mayan (base 20): 𝋰·𝋦·𝋭·𝋪
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 130670, here are decompositions:

13 + 130657 = 130670
19 + 130651 = 130670
31 + 130639 = 130670
37 + 130633 = 130670
139 + 130531 = 130670
157 + 130513 = 130670
181 + 130489 = 130670
193 + 130477 = 130670

Showing the first eight; more decompositions exist.

Hex color

#01FE6E

RGB(1, 254, 110)

IPv4 address

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

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

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 130,670 and was likely granted around 1872.

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

Look up US130,670 on Google Patents ↗ Look up on USPTO ↗