# 130339 (number)

130,339 (one hundred thirty thousand three hundred thirty-nine) is an odd six-digits composite number following 130338 and preceding 130340. In scientific notation, it is written as 1.30339 × 105. The sum of its digits is 19. It has a total of 4 prime factors and 12 positive divisors. There are 108,800 positive integers (up to 130339) that are relatively prime to 130339.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 6
• Sum of Digits 19
• Digital Root 1

## Name

Short name 130 thousand 339 one hundred thirty thousand three hundred thirty-nine

## Notation

Scientific notation 1.30339 × 105 130.339 × 103

## Prime Factorization of 130339

Prime Factorization 11 × 172 × 41

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 4 Total number of prime factors rad(n) 7667 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 130,339 is 11 × 172 × 41. Since it has a total of 4 prime factors, 130,339 is a composite number.

## Divisors of 130339

12 divisors

 Even divisors 0 12 6 6
Total Divisors Sum of Divisors Aliquot Sum τ(n) 12 Total number of the positive divisors of n σ(n) 154728 Sum of all the positive divisors of n s(n) 24389 Sum of the proper positive divisors of n A(n) 12894 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 361.025 Returns the nth root of the product of n divisors H(n) 10.1085 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 130,339 can be divided by 12 positive divisors (out of which 0 are even, and 12 are odd). The sum of these divisors (counting 130,339) is 154,728, the average is 12,894.

## Other Arithmetic Functions (n = 130339)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 108800 Total number of positive integers not greater than n that are coprime to n λ(n) 1360 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 12157 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 108,800 positive integers (less than 130,339) that are coprime with 130,339. And there are approximately 12,157 prime numbers less than or equal to 130,339.

## Divisibility of 130339

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

130,339 is not divisible by any number less than or equal to 9.

• Arithmetic
• Deficient

• Polite

## Base conversion (130339)

Base System Value
2 Binary 11111110100100011
3 Ternary 20121210101
4 Quaternary 133310203
5 Quinary 13132324
6 Senary 2443231
8 Octal 376443
10 Decimal 130339
12 Duodecimal 63517
20 Vigesimal g5gj
36 Base36 2skj

## Basic calculations (n = 130339)

### Multiplication

n×y
 n×2 260678 391017 521356 651695

### Division

n÷y
 n÷2 65169.5 43446.3 32584.8 26067.8

### Exponentiation

ny
 n2 16988254921 2214232158148219 288600805260880716241 37615940356897931674135699

### Nth Root

y√n
 2√n 361.025 50.702 19.0007 10.5442

## 130339 as geometric shapes

### Circle

 Diameter 260678 818944 5.33702e+10

### Sphere

 Volume 9.27495e+15 2.13481e+11 818944

### Square

Length = n
 Perimeter 521356 1.69883e+10 184327

### Cube

Length = n
 Surface area 1.0193e+11 2.21423e+15 225754

### Equilateral Triangle

Length = n
 Perimeter 391017 7.35613e+09 112877

### Triangular Pyramid

Length = n
 Surface area 2.94245e+10 2.6095e+14 106421

## Cryptographic Hash Functions

md5 f2dc7a38207475730d5d89a73279e16a 38f789ffcf9d5775b01f25e1f6197c00d197c7f0 593df3c0333b38c4f49415e325bafdbd491e4298099e3bbcdf45124895cd8cbe 195818e1a60a84ad182ac9ced2f0d45717717b42071bd67e5e9a78c9e82822e1e0e866fba609ec086a72cd5dea1eb33dd10989c054fa6538cc2a60ab2f149646 cdf0fc2585eec5d744286374142e462ae5c337a8
{"ft_lang_label":"__label__en","ft_lang_prob":0.60729545,"math_prob":0.985489,"size":4603,"snap":"2021-31-2021-39","text_gpt3_token_len":1604,"char_repetition_ratio":0.1189389,"word_repetition_ratio":0.0295858,"special_character_ratio":0.4597002,"punctuation_ratio":0.07554417,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.996052,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-22T11:05:08Z\",\"WARC-Record-ID\":\"<urn:uuid:22258431-f8ce-4c3c-84e7-e7abc9a4a582>\",\"Content-Length\":\"39267\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d7def9b9-0fb7-41d5-882d-7fd2c1f56fd9>\",\"WARC-Concurrent-To\":\"<urn:uuid:3f47b13e-184c-472e-99f4-74cb69eaaf25>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/130339\",\"WARC-Payload-Digest\":\"sha1:T2R24BX4AKDM5A4FJUCEH7Y7Q7I3PJPS\",\"WARC-Block-Digest\":\"sha1:RYAH3IK4OYO7NGVVSTEHJNUZRGFIAHOG\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057347.80_warc_CC-MAIN-20210922102402-20210922132402-00194.warc.gz\"}"}