100870201 (number)

100,870,201 (one hundred million eight hundred seventy thousand two hundred one) is an odd nine-digits prime number following 100870200 and preceding 100870202. In scientific notation, it is written as 1.00870201 × 108. The sum of its digits is 19. It has a total of 1 prime factor and 2 positive divisors. There are 100,870,200 positive integers (up to 100870201) that are relatively prime to 100870201.

Basic properties

• Is Prime? Yes
• Number parity Odd
• Number length 9
• Sum of Digits 19
• Digital Root 1

Name

Short name 100 million 870 thousand 201 one hundred million eight hundred seventy thousand two hundred one

Notation

Scientific notation 1.00870201 × 108 100.870201 × 106

Prime Factorization of 100870201

Prime Factorization 100870201

Prime number
Distinct Factors Total Factors Radical ω(n) 1 Total number of distinct prime factors Ω(n) 1 Total number of prime factors rad(n) 1.0087e+08 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) -1 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) 18.4293 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,870,201 is 100870201. Since it has a total of 1 prime factor, 100,870,201 is a prime number.

Divisors of 100870201

2 divisors

 Even divisors 0 2 2 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 2 Total number of the positive divisors of n σ(n) 1.0087e+08 Sum of all the positive divisors of n s(n) 1 Sum of the proper positive divisors of n A(n) 5.04351e+07 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 10043.4 Returns the nth root of the product of n divisors H(n) 2 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 100,870,201 can be divided by 2 positive divisors (out of which 0 are even, and 2 are odd). The sum of these divisors (counting 100,870,201) is 100,870,202, the average is 50,435,101.

Other Arithmetic Functions (n = 100870201)

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

There are 100,870,200 positive integers (less than 100,870,201) that are coprime with 100,870,201. And there are approximately 5,801,292 prime numbers less than or equal to 100,870,201.

Divisibility of 100870201

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

100,870,201 is not divisible by any number less than or equal to 9.

• Arithmetic
• Prime
• Deficient

• Polite

• Prime Power
• Square Free

Base conversion (100870201)

Base System Value
2 Binary 110000000110010100000111001
3 Ternary 21000210201220101
4 Quaternary 12000302200321
5 Quinary 201310321301
6 Senary 14001555401
8 Octal 600624071
10 Decimal 100870201
12 Duodecimal 29945b61
20 Vigesimal 1ba8fa1
36 Base36 1o1zy1

Basic calculations (n = 100870201)

Multiplication

n×y
 n×2 201740402 302610603 403480804 504351005

Division

n÷y
 n÷2 5.04351e+07 3.36234e+07 2.52176e+07 2.0174e+07

Exponentiation

ny
 n2 10174797449780401 1026333863893636454730601 103526503144057751809603123720801 10442739180968237380642780819945064751001

Nth Root

y√n
 2√n 10043.4 465.501 100.217 39.8798

100870201 as geometric shapes

Circle

 Diameter 2.0174e+08 6.33786e+08 3.19651e+16

Sphere

 Volume 4.2991e+24 1.2786e+17 6.33786e+08

Square

Length = n
 Perimeter 4.03481e+08 1.01748e+16 1.42652e+08

Cube

Length = n
 Surface area 6.10488e+16 1.02633e+24 1.74712e+08

Equilateral Triangle

Length = n
 Perimeter 3.02611e+08 4.40582e+15 8.73562e+07

Triangular Pyramid

Length = n
 Surface area 1.76233e+16 1.20955e+23 8.23602e+07

Cryptographic Hash Functions

md5 d391545e44bb2d6fc1f2a766d2ad36e8 72755f5fb7bb72d0ac9f02f5511038b6a7ebc813 8a54ce7c4cb35f887b71cf68c689fd688226496f807a548bdc1407915ce21994 30d6cf19ed371fb371c670421dbcc3518fe6c3d253fc519148546b30bced278b439c25478eec6f95d871642245e4e17fa9811f46757c4d3df417fc24d9f91b0f 344e43caa0703046e2c532a6c83db04fb92ae0cb
{"ft_lang_label":"__label__en","ft_lang_prob":0.60980856,"math_prob":0.98017454,"size":4947,"snap":"2022-05-2022-21","text_gpt3_token_len":1736,"char_repetition_ratio":0.13412908,"word_repetition_ratio":0.040816326,"special_character_ratio":0.48615322,"punctuation_ratio":0.09068924,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9970275,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-01-24T03:29:45Z\",\"WARC-Record-ID\":\"<urn:uuid:b0457118-17cc-4cc9-895f-60fe2a90af38>\",\"Content-Length\":\"39959\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:36bb422e-391f-4174-8ae9-d8dfdb4940b6>\",\"WARC-Concurrent-To\":\"<urn:uuid:f2ae6de3-6dd2-4501-ab7e-4e4d88f60bb6>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/100870201\",\"WARC-Payload-Digest\":\"sha1:JJMF4ZZCUNFNBUUS74EKDJKYH6HMEV7P\",\"WARC-Block-Digest\":\"sha1:CKTS4OCE3SRNSHO4UU67VFS3CNYKY2FT\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-05/CC-MAIN-2022-05_segments_1642320304471.99_warc_CC-MAIN-20220124023407-20220124053407-00012.warc.gz\"}"}