# 73102 (number)

73,102 (seventy-three thousand one hundred two) is an even five-digits composite number following 73101 and preceding 73103. In scientific notation, it is written as 7.3102 × 104. The sum of its digits is 13. It has a total of 2 prime factors and 4 positive divisors. There are 36,550 positive integers (up to 73102) that are relatively prime to 73102.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 5
• Sum of Digits 13
• Digital Root 4

## Name

Short name 73 thousand 102 seventy-three thousand one hundred two

## Notation

Scientific notation 7.3102 × 104 73.102 × 103

## Prime Factorization of 73102

Prime Factorization 2 × 36551

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 2 Total number of prime factors rad(n) 73102 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) 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 73,102 is 2 × 36551. Since it has a total of 2 prime factors, 73,102 is a composite number.

## Divisors of 73102

1, 2, 36551, 73102

4 divisors

 Even divisors 2 2 1 1
Total Divisors Sum of Divisors Aliquot Sum τ(n) 4 Total number of the positive divisors of n σ(n) 109656 Sum of all the positive divisors of n s(n) 36554 Sum of the proper positive divisors of n A(n) 27414 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 270.374 Returns the nth root of the product of n divisors H(n) 2.66659 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 73,102 can be divided by 4 positive divisors (out of which 2 are even, and 2 are odd). The sum of these divisors (counting 73,102) is 109,656, the average is 27,414.

## Other Arithmetic Functions (n = 73102)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 36550 Total number of positive integers not greater than n that are coprime to n λ(n) 36550 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 7220 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 36,550 positive integers (less than 73,102) that are coprime with 73,102. And there are approximately 7,220 prime numbers less than or equal to 73,102.

## Divisibility of 73102

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

The number 73,102 is divisible by 2.

## Classification of 73102

• Arithmetic
• Semiprime
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

## Base conversion (73102)

Base System Value
2 Binary 10001110110001110
3 Ternary 10201021111
4 Quaternary 101312032
5 Quinary 4314402
6 Senary 1322234
8 Octal 216616
10 Decimal 73102
12 Duodecimal 3637a
20 Vigesimal 92f2
36 Base36 1kem

## Basic calculations (n = 73102)

### Multiplication

n×y
 n×2 146204 219306 292408 365510

### Division

n÷y
 n÷2 36551 24367.3 18275.5 14620.4

### Exponentiation

ny
 n2 5343902404 390649953537208 28557292903476979216 2087595225829974134648032

### Nth Root

y√n
 2√n 270.374 41.8128 16.443 9.3926

## 73102 as geometric shapes

### Circle

 Diameter 146204 459313 1.67884e+10

### Sphere

 Volume 1.63635e+15 6.71535e+10 459313

### Square

Length = n
 Perimeter 292408 5.3439e+09 103382

### Cube

Length = n
 Surface area 3.20634e+10 3.9065e+14 126616

### Equilateral Triangle

Length = n
 Perimeter 219306 2.31398e+09 63308.2

### Triangular Pyramid

Length = n
 Surface area 9.25591e+09 4.60385e+13 59687.5

## Cryptographic Hash Functions

md5 04af62b75b5ea0c81bf264611bdb6407 8d6a16e8098736a082346ae412c97da22b9010a2 38e36092618f4ff6d387650b3d898695f3cf82797422035dc3386415ca423a2d 1d3697950d5eb124d1a08235e2338724bd1b908b7e1125e044b54aa2fb7b980eebe56c9bca8e284b148bdf8a9df49bc006f262e210bee736da084df94016467a 39f96991795c185c8d1a229b3c622ccff1af64d1
{"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}