# 100331700 (number)

100,331,700 (one hundred million three hundred thirty-one thousand seven hundred) is an even nine-digits composite number following 100331699 and preceding 100331701. In scientific notation, it is written as 1.003317 × 108. The sum of its digits is 15. It has a total of 7 prime factors and 72 positive divisors. There are 22,932,480 positive integers (up to 100331700) that are relatively prime to 100331700.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 9
• Sum of Digits 15
• Digital Root 6

## Name

Short name 100 million 331 thousand 700 one hundred million three hundred thirty-one thousand seven hundred

## Notation

Scientific notation 1.003317 × 108 100.3317 × 106

## Prime Factorization of 100331700

Prime Factorization 22 × 3 × 52 × 7 × 47777

Composite number
Distinct Factors Total Factors Radical ω(n) 5 Total number of distinct prime factors Ω(n) 7 Total number of prime factors rad(n) 10033170 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,331,700 is 22 × 3 × 52 × 7 × 47777. Since it has a total of 7 prime factors, 100,331,700 is a composite number.

## Divisors of 100331700

72 divisors

 Even divisors 48 24 12 12
Total Divisors Sum of Divisors Aliquot Sum τ(n) 72 Total number of the positive divisors of n σ(n) 3.3177e+08 Sum of all the positive divisors of n s(n) 2.31439e+08 Sum of the proper positive divisors of n A(n) 4.60792e+06 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 10016.6 Returns the nth root of the product of n divisors H(n) 21.7737 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 100,331,700 can be divided by 72 positive divisors (out of which 48 are even, and 24 are odd). The sum of these divisors (counting 100,331,700) is 331,770,432, the average is 46,079,22.,666.

## Other Arithmetic Functions (n = 100331700)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 22932480 Total number of positive integers not greater than n that are coprime to n λ(n) 716640 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 5772102 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 22,932,480 positive integers (less than 100,331,700) that are coprime with 100,331,700. And there are approximately 5,772,102 prime numbers less than or equal to 100,331,700.

## Divisibility of 100331700

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

The number 100,331,700 is divisible by 2, 3, 4, 5, 6 and 7.

• Abundant

• Polite

## Base conversion (100331700)

Base System Value
2 Binary 101111110101111000010110100
3 Ternary 20222210101012220
4 Quaternary 11332233002310
5 Quinary 201141103300
6 Senary 13542242340
8 Octal 576570264
10 Decimal 100331700
12 Duodecimal 297263b0
20 Vigesimal 1b71950
36 Base36 1nqgfo

## Basic calculations (n = 100331700)

### Multiplication

n×y
 n×2 200663400 300995100 401326800 501658500

### Division

n÷y
 n÷2 5.01658e+07 3.34439e+07 2.50829e+07 2.00663e+07

### Exponentiation

ny
 n2 10066450024890000 1009984043962256013000000 101333416103607881619512100000000 10166953904482354896284402163570000000000

### Nth Root

y√n
 2√n 10016.6 464.672 100.083 39.8371

## 100331700 as geometric shapes

### Circle

 Diameter 2.00663e+08 6.30403e+08 3.16247e+16

### Sphere

 Volume 4.23061e+24 1.26499e+17 6.30403e+08

### Square

Length = n
 Perimeter 4.01327e+08 1.00665e+16 1.4189e+08

### Cube

Length = n
 Surface area 6.03987e+16 1.00998e+24 1.7378e+08

### Equilateral Triangle

Length = n
 Perimeter 3.00995e+08 4.3589e+15 8.68898e+07

### Triangular Pyramid

Length = n
 Surface area 1.74356e+16 1.19028e+23 8.19205e+07

## Cryptographic Hash Functions

md5 e7c7768a6d65c549f1bfe02e3d00aed7 8fe9bc0c4c7f3289501f40bf705b42199f928f48 7f246113a11014dc2056ec617933f9b0a258964cf13043d578d9807a3398b7a7 697d97f6a45c56c2644bae430f65af9db06c91f99697656a8bdc0023e60af2db0a413c58f0fc73816cc7868f54b103144b93da2fef451acf0bfa2bd80bd0cc7c c10263305e5eae27b25fba0195ca6fca04925c11
{"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}