# 100055000 (number)

100,055,000 (one hundred million fifty-five thousand) is an even nine-digits composite number following 100054999 and preceding 100055001. In scientific notation, it is written as 1.00055 × 108. The sum of its digits is 11. It has a total of 8 prime factors and 40 positive divisors. There are 40,020,000 positive integers (up to 100055000) that are relatively prime to 100055000.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 9
• Sum of Digits 11
• Digital Root 2

## Name

Short name 100 million 55 thousand one hundred million fifty-five thousand

## Notation

Scientific notation 1.00055 × 108 100.055 × 106

## Prime Factorization of 100055000

Prime Factorization 23 × 54 × 20011

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 8 Total number of prime factors rad(n) 200110 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 100,055,000 is 23 × 54 × 20011. Since it has a total of 8 prime factors, 100,055,000 is a composite number.

## Divisors of 100055000

40 divisors

 Even divisors 30 10 5 5
Total Divisors Sum of Divisors Aliquot Sum τ(n) 40 Total number of the positive divisors of n σ(n) 2.34441e+08 Sum of all the positive divisors of n s(n) 1.34386e+08 Sum of the proper positive divisors of n A(n) 5.86101e+06 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 10002.7 Returns the nth root of the product of n divisors H(n) 17.0713 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 100,055,000 can be divided by 40 positive divisors (out of which 30 are even, and 10 are odd). The sum of these divisors (counting 100,055,000) is 234,440,580, the average is 586,101,4.5.

## Other Arithmetic Functions (n = 100055000)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 40020000 Total number of positive integers not greater than n that are coprime to n λ(n) 1000500 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 5757100 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 40,020,000 positive integers (less than 100,055,000) that are coprime with 100,055,000. And there are approximately 5,757,100 prime numbers less than or equal to 100,055,000.

## Divisibility of 100055000

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

The number 100,055,000 is divisible by 2, 4, 5 and 8.

• Refactorable
• Abundant

• Polite

• Frugal

## Base conversion (100055000)

Base System Value
2 Binary 101111101101011011111011000
3 Ternary 20222021022122202
4 Quaternary 11331223133120
5 Quinary 201103230000
6 Senary 13532305332
8 Octal 575533730
10 Decimal 100055000
12 Duodecimal 29612248
20 Vigesimal 1b56ha0
36 Base36 1nkixk

## Basic calculations (n = 100055000)

### Multiplication

n×y
 n×2 200110000 300165000 400220000 500275000

### Division

n÷y
 n÷2 5.00275e+07 3.33517e+07 2.50138e+07 2.0011e+07

### Exponentiation

ny
 n2 10011003025000000 1001650907666375000000000 100220181566559150625000000000000 10027530266642075815784375000000000000000

### Nth Root

y√n
 2√n 10002.7 464.244 100.014 39.8151

## 100055000 as geometric shapes

### Circle

 Diameter 2.0011e+08 6.28664e+08 3.14505e+16

### Sphere

 Volume 4.19571e+24 1.25802e+17 6.28664e+08

### Square

Length = n
 Perimeter 4.0022e+08 1.0011e+16 1.41499e+08

### Cube

Length = n
 Surface area 6.0066e+16 1.00165e+24 1.733e+08

### Equilateral Triangle

Length = n
 Perimeter 3.00165e+08 4.33489e+15 8.66502e+07

### Triangular Pyramid

Length = n
 Surface area 1.73396e+16 1.18046e+23 8.16946e+07
{"ft_lang_label":"__label__en","ft_lang_prob":0.6055414,"math_prob":0.9957359,"size":4864,"snap":"2021-43-2021-49","text_gpt3_token_len":1728,"char_repetition_ratio":0.13271604,"word_repetition_ratio":0.025185185,"special_character_ratio":0.49054277,"punctuation_ratio":0.09512195,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9983169,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-01T10:50:49Z\",\"WARC-Record-ID\":\"<urn:uuid:2488bf38-9c6d-46b0-9574-9d234ec221b8>\",\"Content-Length\":\"41025\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:4704feeb-aa2c-44d7-bd76-151f0abf94ce>\",\"WARC-Concurrent-To\":\"<urn:uuid:367df817-7071-4547-804d-1ed03105d1ae>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/100055000\",\"WARC-Payload-Digest\":\"sha1:M4FX7NW4EHPNYS23FHNTS7YR6RL54Z42\",\"WARC-Block-Digest\":\"sha1:BMHL6HYSCJLOYXBKGFA37QIUPJOX7NGF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964359976.94_warc_CC-MAIN-20211201083001-20211201113001-00554.warc.gz\"}"}