# 100028500 (number)

100,028,500 (one hundred million twenty-eight thousand five hundred) is an even nine-digits composite number following 100028499 and preceding 100028501. In scientific notation, it is written as 1.000285 × 108. The sum of its digits is 16. It has a total of 8 prime factors and 96 positive divisors. There are 33,552,000 positive integers (up to 100028500) that are relatively prime to 100028500.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 9
• Sum of Digits 16
• Digital Root 7

## Name

Short name 100 million 28 thousand 500 one hundred million twenty-eight thousand five hundred

## Notation

Scientific notation 1.000285 × 108 100.0285 × 106

## Prime Factorization of 100028500

Prime Factorization 22 × 53 × 11 × 13 × 1399

Composite number
Distinct Factors Total Factors Radical ω(n) 5 Total number of distinct prime factors Ω(n) 8 Total number of prime factors rad(n) 2000570 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,028,500 is 22 × 53 × 11 × 13 × 1399. Since it has a total of 8 prime factors, 100,028,500 is a composite number.

## Divisors of 100028500

96 divisors

 Even divisors 64 32 16 16
Total Divisors Sum of Divisors Aliquot Sum τ(n) 96 Total number of the positive divisors of n σ(n) 2.56838e+08 Sum of all the positive divisors of n s(n) 1.5681e+08 Sum of the proper positive divisors of n A(n) 2.6754e+06 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 10001.4 Returns the nth root of the product of n divisors H(n) 37.3882 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 100,028,500 can be divided by 96 positive divisors (out of which 64 are even, and 32 are odd). The sum of these divisors (counting 100,028,500) is 256,838,400, the average is 2,675,400.

## Other Arithmetic Functions (n = 100028500)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 33552000 Total number of positive integers not greater than n that are coprime to n λ(n) 69900 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 5755663 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 33,552,000 positive integers (less than 100,028,500) that are coprime with 100,028,500. And there are approximately 5,755,663 prime numbers less than or equal to 100,028,500.

## Divisibility of 100028500

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

The number 100,028,500 is divisible by 2, 4 and 5.

• Arithmetic
• Abundant

• Polite
• Practical

## Base conversion (100028500)

Base System Value
2 Binary 101111101100101000001010100
3 Ternary 20222012222022021
4 Quaternary 11331211001110
5 Quinary 201101403000
6 Senary 13531542524
8 Octal 575450124
10 Decimal 100028500
12 Duodecimal 295baa44
20 Vigesimal 1b53b50
36 Base36 1njyhg

## Basic calculations (n = 100028500)

### Multiplication

n×y
 n×2 200057000 300085500 400114000 500142500

### Division

n÷y
 n÷2 5.00142e+07 3.33428e+07 2.50071e+07 2.00057e+07

### Exponentiation

ny
 n2 10005700812250000 1000855243698149125000000 100114048744260309750062500000000 10014258124815242393834126781250000000000

### Nth Root

y√n
 2√n 10001.4 464.203 100.007 39.813

## 100028500 as geometric shapes

### Circle

 Diameter 2.00057e+08 6.28498e+08 3.14338e+16

### Sphere

 Volume 4.19237e+24 1.25735e+17 6.28498e+08

### Square

Length = n
 Perimeter 4.00114e+08 1.00057e+16 1.41462e+08

### Cube

Length = n
 Surface area 6.00342e+16 1.00086e+24 1.73254e+08

### Equilateral Triangle

Length = n
 Perimeter 3.00086e+08 4.3326e+15 8.66272e+07

### Triangular Pyramid

Length = n
 Surface area 1.73304e+16 1.17952e+23 8.16729e+07

## Cryptographic Hash Functions

md5 e8597d5aa3ee003c42d33f4231028104 9082aa80b6d4598bdc9b3e826a33d39386f4f433 dc46967bc6e24d5205e4e99dc26b8792049bad9e6b8bd281cd6ca8920ec72e32 be11e94ea6aa1702616c1ca2b0f102f897681ed8ec40f733c94caec40863903ecac1311a6412cb3e16b16f1e4a12d1969b51fae2cf60708a041a7af27e40cc35 62a4898be1d3d47181eba016f7bd6966998e4e50
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://metanumbers.com/100028500", "fetch_time": 1638792641000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2021-49/segments/1637964363292.82/warc/CC-MAIN-20211206103243-20211206133243-00009.warc.gz", "warc_record_offset": 455186366, "warc_record_length": 7732, "token_count": 1595, "char_count": 4442, "score": 3.65625, "int_score": 4, "crawl": "CC-MAIN-2021-49", "snapshot_type": "latest", "language": "en", "language_score": 0.772895097732544, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00047-of-00064.parquet"}