# 109676 (number)

109,676 (one hundred nine thousand six hundred seventy-six) is an even six-digits composite number following 109675 and preceding 109677. In scientific notation, it is written as 1.09676 × 105. The sum of its digits is 29. It has a total of 4 prime factors and 12 positive divisors. There are 46,992 positive integers (up to 109676) that are relatively prime to 109676.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 6
• Sum of Digits 29
• Digital Root 2

## Name

Short name 109 thousand 676 one hundred nine thousand six hundred seventy-six

## Notation

Scientific notation 1.09676 × 105 109.676 × 103

## Prime Factorization of 109676

Prime Factorization 22 × 7 × 3917

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 4 Total number of prime factors rad(n) 54838 Product of the distinct prime numbers λ(n) 1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) 0 Returns: 1, if n has an even number of prime factors (and is square free) −1, if n has an odd number of prime factors (and is square free) 0, if n has a squared prime factor Λ(n) 0 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 109,676 is 22 × 7 × 3917. Since it has a total of 4 prime factors, 109,676 is a composite number.

## Divisors of 109676

12 divisors

 Even divisors 8 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 12 Total number of the positive divisors of n σ(n) 219408 Sum of all the positive divisors of n s(n) 109732 Sum of the proper positive divisors of n A(n) 18284 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 331.174 Returns the nth root of the product of n divisors H(n) 5.99847 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 109,676 can be divided by 12 positive divisors (out of which 8 are even, and 4 are odd). The sum of these divisors (counting 109,676) is 219,408, the average is 18,284.

## Other Arithmetic Functions (n = 109676)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 46992 Total number of positive integers not greater than n that are coprime to n λ(n) 11748 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 10397 Total number of primes less than or equal to n r2(n) 0 The number of ways n can be represented as the sum of 2 squares

There are 46,992 positive integers (less than 109,676) that are coprime with 109,676. And there are approximately 10,397 prime numbers less than or equal to 109,676.

## Divisibility of 109676

 m n mod m 2 3 4 5 6 7 8 9 0 2 0 1 2 0 4 2

The number 109,676 is divisible by 2, 4 and 7.

• Arithmetic
• Abundant

• Polite

## Base conversion (109676)

Base System Value
2 Binary 11010110001101100
3 Ternary 12120110002
4 Quaternary 122301230
5 Quinary 12002201
6 Senary 2203432
8 Octal 326154
10 Decimal 109676
12 Duodecimal 53578
20 Vigesimal de3g
36 Base36 2cmk

## Basic calculations (n = 109676)

### Multiplication

n×y
 n×2 219352 329028 438704 548380

### Division

n÷y
 n÷2 54838 36558.7 27419 21935.2

### Exponentiation

ny
 n2 12028824976 1319273408067776 144692630303241400576 15869308921138303849573376

### Nth Root

y√n
 2√n 331.174 47.8671 18.1982 10.1864

## 109676 as geometric shapes

### Circle

 Diameter 219352 689115 3.77897e+10

### Sphere

 Volume 5.52616e+15 1.51159e+11 689115

### Square

Length = n
 Perimeter 438704 1.20288e+10 155105

### Cube

Length = n
 Surface area 7.21729e+10 1.31927e+15 189964

### Equilateral Triangle

Length = n
 Perimeter 329028 5.20863e+09 94982.2

### Triangular Pyramid

Length = n
 Surface area 2.08345e+10 1.55478e+14 89550.1
{"ft_lang_label":"__label__en","ft_lang_prob":0.6196299,"math_prob":0.9860849,"size":4578,"snap":"2021-43-2021-49","text_gpt3_token_len":1595,"char_repetition_ratio":0.12024486,"word_repetition_ratio":0.028231798,"special_character_ratio":0.46199214,"punctuation_ratio":0.07702182,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9986562,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-19T12:31:29Z\",\"WARC-Record-ID\":\"<urn:uuid:b3bc53e3-4bfd-42d7-af63-95b88570e14f>\",\"Content-Length\":\"39423\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:cb92e086-3195-40e2-9e36-39d65792f7da>\",\"WARC-Concurrent-To\":\"<urn:uuid:d1209582-44e9-448a-bf94-b881a6135081>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/109676\",\"WARC-Payload-Digest\":\"sha1:3R6CF6SPSHS3SOWIBYDFXPJA3GHAZRXJ\",\"WARC-Block-Digest\":\"sha1:SIRP27ZGQUVQYDVM66XSJ63NWSVBAP5Y\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585265.67_warc_CC-MAIN-20211019105138-20211019135138-00594.warc.gz\"}"}