# 80005 (number)

80,005 (eighty thousand five) is an odd five-digits composite number following 80004 and preceding 80006. In scientific notation, it is written as 8.0005 × 104. The sum of its digits is 13. It has a total of 2 prime factors and 4 positive divisors. There are 64,000 positive integers (up to 80005) that are relatively prime to 80005.

## Basic properties

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

## Name

Short name 80 thousand 5 eighty thousand five

## Notation

Scientific notation 8.0005 × 104 80.005 × 103

## Prime Factorization of 80005

Prime Factorization 5 × 16001

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 2 Total number of prime factors rad(n) 80005 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 80,005 is 5 × 16001. Since it has a total of 2 prime factors, 80,005 is a composite number.

## Divisors of 80005

1, 5, 16001, 80005

4 divisors

 Even divisors 0 4 4 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 4 Total number of the positive divisors of n σ(n) 96012 Sum of all the positive divisors of n s(n) 16007 Sum of the proper positive divisors of n A(n) 24003 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 282.852 Returns the nth root of the product of n divisors H(n) 3.33313 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 80,005 can be divided by 4 positive divisors (out of which 0 are even, and 4 are odd). The sum of these divisors (counting 80,005) is 96,012, the average is 24,003.

## Other Arithmetic Functions (n = 80005)

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

There are 64,000 positive integers (less than 80,005) that are coprime with 80,005. And there are approximately 7,832 prime numbers less than or equal to 80,005.

## Divisibility of 80005

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

The number 80,005 is divisible by 5.

## Classification of 80005

• Arithmetic
• Semiprime
• Deficient

• Polite

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (80005)

Base System Value
2 Binary 10011100010000101
3 Ternary 11001202011
4 Quaternary 103202011
5 Quinary 10030010
6 Senary 1414221
8 Octal 234205
10 Decimal 80005
12 Duodecimal 3a371
20 Vigesimal a005
36 Base36 1pqd

## Basic calculations (n = 80005)

### Multiplication

n×y
 n×2 160010 240015 320020 400025

### Division

n÷y
 n÷2 40002.5 26668.3 20001.2 16001

### Exponentiation

ny
 n2 6400800025 512096006000125 40970240960040000625 3277824128008000250003125

### Nth Root

y√n
 2√n 282.852 43.0896 16.8182 9.56364

## 80005 as geometric shapes

### Circle

 Diameter 160010 502686 2.01087e+10

### Sphere

 Volume 2.14506e+15 8.04348e+10 502686

### Square

Length = n
 Perimeter 320020 6.4008e+09 113144

### Cube

Length = n
 Surface area 3.84048e+10 5.12096e+14 138573

### Equilateral Triangle

Length = n
 Perimeter 240015 2.77163e+09 69286.4

### Triangular Pyramid

Length = n
 Surface area 1.10865e+10 6.03511e+13 65323.8

## Cryptographic Hash Functions

md5 a833745cd3fec33ab9cf5735c8b9ae36 968eca5f557ec64d248d6ea74f759ae7bf8a7217 fad16ffe44e92f5752d17b494081f5b0fefcf363ed7c2b4081e3866e98c19b28 9df66f75543ea8aa1234029b0c6f5615b445eb1b03df57fa50973973800d2301a676cb8d9aa92facdb31fc2a0b738a4ccaa57f711b2ba5d3eca219a2fffb2168 ce38bc83916b814491c16083067238002a81f1db
{"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}