number.wiki
Live analysis

109,520

109,520 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.).
Abundant Number Gapful Number Odious Number Practical Number Recamán's Sequence Semiperfect Number

Interestingness

Properties

Parity
Even
Digit count
6
Digit sum
17
Digit product
0
Digital root
8
Palindrome
No
Bit width
17 bits
Reversed
25,901
Recamán's sequence
a(78,771) = 109,520
Square (n²)
11,994,630,400
Cube (n³)
1,313,651,921,408,000
Divisor count
30
σ(n) — sum of divisors
261,702
φ(n) — Euler's totient
42,624
Sum of prime factors
87

Primality

Prime factorization: 2 4 × 5 × 37 2

Nearest primes: 109,519 (−1) · 109,537 (+17)

Divisors & multiples

All divisors (30)
1 · 2 · 4 · 5 · 8 · 10 · 16 · 20 · 37 · 40 · 74 · 80 · 148 · 185 · 296 · 370 · 592 · 740 · 1369 · 1480 · 2738 · 2960 · 5476 · 6845 · 10952 · 13690 · 21904 · 27380 · 54760 (half) · 109520
Aliquot sum (sum of proper divisors): 152,182
Factor pairs (a × b = 109,520)
1 × 109520
2 × 54760
4 × 27380
5 × 21904
8 × 13690
10 × 10952
16 × 6845
20 × 5476
37 × 2960
40 × 2738
74 × 1480
80 × 1369
148 × 740
185 × 592
296 × 370
First multiples
109,520 · 219,040 (double) · 328,560 · 438,080 · 547,600 · 657,120 · 766,640 · 876,160 · 985,680 · 1,095,200

Sums & aliquot sequence

As a sum of two squares: 44² + 328² = 148² + 296² = 232² + 236²
As consecutive integers: 21,902 + 21,903 + 21,904 + 21,905 + 21,906 3,407 + 3,408 + … + 3,438 2,942 + 2,943 + … + 2,978 605 + 606 + … + 764
Aliquot sequence: 109,520 152,182 76,094 38,050 32,816 40,096 50,624 65,200 92,404 81,840 203,856 343,728 894,288 1,494,448 1,648,208 1,649,200 3,271,120 — unresolved within range

Continued fraction of √n

√109,520 = [330; (1, 15, 6, 1, 9, 2, 14, 1, 1, 3, 4, 10, 9, 4, 2, 5, 41, 5, 2, 4, 9, 10, 4, 3, …)]

Period length 34 — the block in parentheses repeats forever.

Representations

In words
one hundred nine thousand five hundred twenty
Ordinal
109520th
Binary
11010101111010000
Octal
325720
Hexadecimal
0x1ABD0
Base64
AavQ
One's complement
4,294,857,775 (32-bit)
Scientific notation
1.0952 × 10⁵
As a duration
109,520 s = 1 day, 6 hours, 25 minutes, 20 seconds
In other bases
ternary (3) 12120020022
quaternary (4) 122233100
quinary (5) 12001040
senary (6) 2203012
septenary (7) 634205
nonary (9) 176208
undecimal (11) 75314
duodecimal (12) 53468
tridecimal (13) 3ab08
tetradecimal (14) 2bcac
pentadecimal (15) 226b5

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

  • 3 + 109517 = 109520
  • 13 + 109507 = 109520
  • 67 + 109453 = 109520
  • 79 + 109441 = 109520
  • 97 + 109423 = 109520
  • 157 + 109363 = 109520
  • 163 + 109357 = 109520
  • 199 + 109321 = 109520

Showing the first eight; more decompositions exist.

Hex color
#01ABD0
RGB(1, 171, 208)
IPv4 address

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

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

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 109,520 and was likely granted around 1871.

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

Position in π

The digit sequence 109520 first appears in π at position 289,828 of the decimal expansion (the 289,828ordinal-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.