# 130692 (number)

130,692 (one hundred thirty thousand six hundred ninety-two) is an even six-digits composite number following 130691 and preceding 130693. In scientific notation, it is written as 1.30692 × 105. The sum of its digits is 21. It has a total of 4 prime factors and 12 positive divisors. There are 43,560 positive integers (up to 130692) that are relatively prime to 130692.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 6
• Sum of Digits 21
• Digital Root 3

## Name

Short name 130 thousand 692 one hundred thirty thousand six hundred ninety-two

## Notation

Scientific notation 1.30692 × 105 130.692 × 103

## Prime Factorization of 130692

Prime Factorization 22 × 3 × 10891

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

## Divisors of 130692

12 divisors

 Even divisors 8 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 12 Total number of the positive divisors of n σ(n) 304976 Sum of all the positive divisors of n s(n) 174284 Sum of the proper positive divisors of n A(n) 25414.7 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 361.513 Returns the nth root of the product of n divisors H(n) 5.14238 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 130,692 can be divided by 12 positive divisors (out of which 8 are even, and 4 are odd). The sum of these divisors (counting 130,692) is 304,976, the average is 254,14.,666.

## Other Arithmetic Functions (n = 130692)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 43560 Total number of positive integers not greater than n that are coprime to n λ(n) 10890 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 12186 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 43,560 positive integers (less than 130,692) that are coprime with 130,692. And there are approximately 12,186 prime numbers less than or equal to 130,692.

## Divisibility of 130692

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

The number 130,692 is divisible by 2, 3, 4 and 6.

## Classification of 130692

• Refactorable
• Abundant

### Expressible via specific sums

• Polite
• Non-hypotenuse

## Base conversion (130692)

Base System Value
2 Binary 11111111010000100
3 Ternary 20122021110
4 Quaternary 133322010
5 Quinary 13140232
6 Senary 2445020
8 Octal 377204
10 Decimal 130692
12 Duodecimal 63770
20 Vigesimal g6ec
36 Base36 2suc

## Basic calculations (n = 130692)

### Multiplication

n×y
 n×2 261384 392076 522768 653460

### Division

n÷y
 n÷2 65346 43564 32673 26138.4

### Exponentiation

ny
 n2 17080398864 2232271488333888 291740025353332490496 38128087393477729847903232

### Nth Root

y√n
 2√n 361.513 50.7477 19.0135 10.5499

## 130692 as geometric shapes

### Circle

 Diameter 261384 821162 5.36597e+10

### Sphere

 Volume 9.35052e+15 2.14639e+11 821162

### Square

Length = n
 Perimeter 522768 1.70804e+10 184826

### Cube

Length = n
 Surface area 1.02482e+11 2.23227e+15 226365

### Equilateral Triangle

Length = n
 Perimeter 392076 7.39603e+09 113183

### Triangular Pyramid

Length = n
 Surface area 2.95841e+10 2.63076e+14 106710

## Cryptographic Hash Functions

md5 0c360a193e5d858b75c12e9a3e52d3f7 0e8291152a079dbc904ca4ec4177a70aefe96752 d623cd5f63c77b3415e2fed948ab3b1a7aa914e76c9096ed1fa8a89c1db82378 4ac7921375c32c9ab9d7ebb2a2f63947eaae99c9e0aed46112243254f3d95bf466a91a650a2c0019f62ff3be6669a6004317f10eb73245bd32266daea7d1781c cfa89bffe95631db9526647bd347bb05426bea0f
{"ft_lang_label":"__label__en","ft_lang_prob":0.60738,"math_prob":0.9842011,"size":4612,"snap":"2021-31-2021-39","text_gpt3_token_len":1628,"char_repetition_ratio":0.119791664,"word_repetition_ratio":0.028106509,"special_character_ratio":0.4611882,"punctuation_ratio":0.08121827,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99527586,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-25T22:29:06Z\",\"WARC-Record-ID\":\"<urn:uuid:c8e1fdd3-ff3b-4f62-93bf-1acf1ec07b16>\",\"Content-Length\":\"39599\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b9fc3b6c-f3f6-47b7-a31c-1b2b600dd30a>\",\"WARC-Concurrent-To\":\"<urn:uuid:70e96984-156b-440d-bc1d-d05064aca010>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/130692\",\"WARC-Payload-Digest\":\"sha1:RUBQ7UTBYVCB44NH6JMWWBMIE3FW6ASX\",\"WARC-Block-Digest\":\"sha1:CPQSJHNH7IZAZPJLUEW5L2MRA4LGMBTT\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057775.50_warc_CC-MAIN-20210925202717-20210925232717-00376.warc.gz\"}"}