# 106083 (number)

106,083 (one hundred six thousand eighty-three) is an odd six-digits composite number following 106082 and preceding 106084. In scientific notation, it is written as 1.06083 × 105. The sum of its digits is 18. It has a total of 4 prime factors and 8 positive divisors. There are 70,704 positive integers (up to 106083) that are relatively prime to 106083.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 6
• Sum of Digits 18
• Digital Root 9

## Name

Short name 106 thousand 83 one hundred six thousand eighty-three

## Notation

Scientific notation 1.06083 × 105 106.083 × 103

## Prime Factorization of 106083

Prime Factorization 33 × 3929

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 4 Total number of prime factors rad(n) 11787 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 106,083 is 33 × 3929. Since it has a total of 4 prime factors, 106,083 is a composite number.

## Divisors of 106083

8 divisors

 Even divisors 0 8 4 4
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 157200 Sum of all the positive divisors of n s(n) 51117 Sum of the proper positive divisors of n A(n) 19650 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 325.704 Returns the nth root of the product of n divisors H(n) 5.39863 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 106,083 can be divided by 8 positive divisors (out of which 0 are even, and 8 are odd). The sum of these divisors (counting 106,083) is 157,200, the average is 19,650.

## Other Arithmetic Functions (n = 106083)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 70704 Total number of positive integers not greater than n that are coprime to n λ(n) 35352 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 10088 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 70,704 positive integers (less than 106,083) that are coprime with 106,083. And there are approximately 10,088 prime numbers less than or equal to 106,083.

## Divisibility of 106083

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

The number 106,083 is divisible by 3 and 9.

• Arithmetic
• Deficient

• Polite

• Frugal

## Base conversion (106083)

Base System Value
2 Binary 11001111001100011
3 Ternary 12101112000
4 Quaternary 121321203
5 Quinary 11343313
6 Senary 2135043
8 Octal 317143
10 Decimal 106083
12 Duodecimal 51483
20 Vigesimal d543
36 Base36 29ur

## Basic calculations (n = 106083)

### Multiplication

n×y
 n×2 212166 318249 424332 530415

### Division

n÷y
 n÷2 53041.5 35361 26520.8 21216.6

### Exponentiation

ny
 n2 11253602889 1193815955273787 126643577983309146321 13434730683203384169170643

### Nth Root

y√n
 2√n 325.704 47.3386 18.0473 10.1188

## 106083 as geometric shapes

### Circle

 Diameter 212166 666539 3.53542e+10

### Sphere

 Volume 5.00064e+15 1.41417e+11 666539

### Square

Length = n
 Perimeter 424332 1.12536e+10 150024

### Cube

Length = n
 Surface area 6.75216e+10 1.19382e+15 183741

### Equilateral Triangle

Length = n
 Perimeter 318249 4.87295e+09 91870.6

### Triangular Pyramid

Length = n
 Surface area 1.94918e+10 1.40693e+14 86616.4

## Cryptographic Hash Functions

md5 271a791fad84141f08b688dd7907b18c b6ed95b4aa4d30bc0a6b31a18d68b72fbddd1f62 fa559fedc59b4b548f36bfe10986fb437399e8b4ed5d082a90baca24d3e5f36b 4bc4638623395ba769f4487e30fb385dbf2a60c891cd4e199139a2604c87f5c18c3df104046f6baaf20a8b5de0e4a463b7612dee2de3af77bc875a42e581f038 fc83fccfc965532e885df7a410f48150ca3d3355
{"ft_lang_label":"__label__en","ft_lang_prob":0.60505927,"math_prob":0.9871585,"size":4554,"snap":"2021-43-2021-49","text_gpt3_token_len":1599,"char_repetition_ratio":0.12153846,"word_repetition_ratio":0.0254491,"special_character_ratio":0.45827845,"punctuation_ratio":0.07512953,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99630946,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-20T03:56:54Z\",\"WARC-Record-ID\":\"<urn:uuid:9bde3a0f-29db-474f-a7d0-aa599018c1c5>\",\"Content-Length\":\"39619\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5f2959aa-f55b-4221-a0aa-f3ceba3be575>\",\"WARC-Concurrent-To\":\"<urn:uuid:34cd654c-0c2e-4ffc-8ab0-dbb996e377a2>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/106083\",\"WARC-Payload-Digest\":\"sha1:2SROX25ASZKSHGITRFAW6MSTJAXHDCG7\",\"WARC-Block-Digest\":\"sha1:WYOMNUWEMVDU2MDSNK36K5YU3NWZ5K7N\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585302.56_warc_CC-MAIN-20211020024111-20211020054111-00523.warc.gz\"}"}