number.wiki
Live analysis

131,650

131,650 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.).

131,650 (one hundred thirty-one thousand six hundred fifty) is an even 6-digit number. It is a composite number with 12 divisors, and factors as 2 × 5² × 2,633. Written other ways, in hexadecimal, 0x20242.

Cube-Free Deficient Number Evil Number Gapful Number Recamán's Sequence

Interestingness

Properties

Parity
Even
Digit count
6
Digit sum
16
Digit product
0
Digital root
7
Palindrome
No
Bit width
18 bits
Reversed
56,131
Recamán's sequence
a(229,072) = 131,650
Square (n²)
17,331,722,500
Cube (n³)
2,281,721,267,125,000
Divisor count
12
σ(n) — sum of divisors
244,962
φ(n) — Euler's totient
52,640
Sum of prime factors
2,645

Primality

Prime factorization: 2 × 5 2 × 2633

Nearest primes: 131,641 (−9) · 131,671 (+21)

Divisors & multiples

All divisors (12)
1 · 2 · 5 · 10 · 25 · 50 · 2633 · 5266 · 13165 · 26330 · 65825 (half) · 131650
Aliquot sum (sum of proper divisors): 113,312
Factor pairs (a × b = 131,650)
1 × 131650
2 × 65825
5 × 26330
10 × 13165
25 × 5266
50 × 2633
First multiples
131,650 · 263,300 (double) · 394,950 · 526,600 · 658,250 · 789,900 · 921,550 · 1,053,200 · 1,184,850 · 1,316,500

Sums & aliquot sequence

As a sum of two squares: 75² + 355² = 153² + 329² = 239² + 273²
As consecutive integers: 32,911 + 32,912 + 32,913 + 32,914 26,328 + 26,329 + 26,330 + 26,331 + 26,332 6,573 + 6,574 + … + 6,592 5,254 + 5,255 + … + 5,278
Aliquot sequence: 131,650 113,312 109,834 54,920 68,740 96,572 96,628 118,832 144,544 140,090 112,090 108,230 90,490 72,410 68,206 35,834 24,646 — unresolved within range

Continued fraction of √n

√131,650 = [362; (1, 5, 10, 18, 1, 1, 28, 1, 1, 18, 10, 5, 1, 724)]

Period length 14 — the block in parentheses repeats forever.

Representations

In words
one hundred thirty-one thousand six hundred fifty
Ordinal
131650th
Binary
100000001001000010
Octal
401102
Hexadecimal
0x20242
Base64
AgJC
One's complement
4,294,835,645 (32-bit)
Scientific notation
1.3165 × 10⁵
As a duration
131,650 s = 1 day, 12 hours, 34 minutes, 10 seconds
In other bases
ternary (3) 20200120221
quaternary (4) 200021002
quinary (5) 13203100
senary (6) 2453254
septenary (7) 1055551
nonary (9) 220527
undecimal (11) 8aa02
duodecimal (12) 6422a
tridecimal (13) 47bcc
tetradecimal (14) 35d98
pentadecimal (15) 2901a

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

  • 11 + 131639 = 131650
  • 23 + 131627 = 131650
  • 59 + 131591 = 131650
  • 89 + 131561 = 131650
  • 107 + 131543 = 131650
  • 131 + 131519 = 131650
  • 149 + 131501 = 131650
  • 173 + 131477 = 131650

Showing the first eight; more decompositions exist.

Unicode codepoint
𠉂
CJK Unified Ideograph-20242
U+20242
Other letter (Lo)

UTF-8 encoding: F0 A0 89 82 (4 bytes).

Hex color
#020242
RGB(2, 2, 66)
IPv4 address

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

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

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

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

Position in π

The digit sequence 131650 first appears in π at position 815,368 of the decimal expansion (the 815,368ordinal-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