# 131688 (number)

131,688 (one hundred thirty-one thousand six hundred eighty-eight) is an even six-digits composite number following 131687 and preceding 131689. In scientific notation, it is written as 1.31688 × 105. The sum of its digits is 27. It has a total of 7 prime factors and 48 positive divisors. There are 41,760 positive integers (up to 131688) that are relatively prime to 131688.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 6
• Sum of Digits 27
• Digital Root 9

## Name

Short name 131 thousand 688 one hundred thirty-one thousand six hundred eighty-eight

## Notation

Scientific notation 1.31688 × 105 131.688 × 103

## Prime Factorization of 131688

Prime Factorization 23 × 32 × 31 × 59

Composite number
Distinct Factors Total Factors Radical ω(n) 4 Total number of distinct prime factors Ω(n) 7 Total number of prime factors rad(n) 10974 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 131,688 is 23 × 32 × 31 × 59. Since it has a total of 7 prime factors, 131,688 is a composite number.

## Divisors of 131688

48 divisors

 Even divisors 36 12 6 6
Total Divisors Sum of Divisors Aliquot Sum τ(n) 48 Total number of the positive divisors of n σ(n) 374400 Sum of all the positive divisors of n s(n) 242712 Sum of the proper positive divisors of n A(n) 7800 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 362.888 Returns the nth root of the product of n divisors H(n) 16.8831 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 131,688 can be divided by 48 positive divisors (out of which 36 are even, and 12 are odd). The sum of these divisors (counting 131,688) is 374,400, the average is 7,800.

## Other Arithmetic Functions (n = 131688)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 41760 Total number of positive integers not greater than n that are coprime to n λ(n) 1740 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 12271 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 41,760 positive integers (less than 131,688) that are coprime with 131,688. And there are approximately 12,271 prime numbers less than or equal to 131,688.

## Divisibility of 131688

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

The number 131,688 is divisible by 2, 3, 4, 6, 8 and 9.

## Classification of 131688

• Arithmetic
• Abundant

### Expressible via specific sums

• Polite
• Practical
• Non-hypotenuse

## Base conversion (131688)

Base System Value
2 Binary 100000001001101000
3 Ternary 20200122100
4 Quaternary 200021220
5 Quinary 13203223
6 Senary 2453400
8 Octal 401150
10 Decimal 131688
12 Duodecimal 64260
20 Vigesimal g948
36 Base36 2tm0

## Basic calculations (n = 131688)

### Multiplication

n×y
 n×2 263376 395064 526752 658440

### Division

n÷y
 n÷2 65844 43896 32922 26337.6

### Exponentiation

ny
 n2 17341729344 2283697653852672 300735576640550670336 39603266616640836675207168

### Nth Root

y√n
 2√n 362.888 50.8763 19.0496 10.566

## 131688 as geometric shapes

### Circle

 Diameter 263376 827420 5.44806e+10

### Sphere

 Volume 9.56593e+15 2.17923e+11 827420

### Square

Length = n
 Perimeter 526752 1.73417e+10 186235

### Cube

Length = n
 Surface area 1.0405e+11 2.2837e+15 228090

### Equilateral Triangle

Length = n
 Perimeter 395064 7.50919e+09 114045

### Triangular Pyramid

Length = n
 Surface area 3.00368e+10 2.69136e+14 107523

## Cryptographic Hash Functions

md5 0eeb661453432c981ad9ab96dac57927 9465d5da6c27cabee7901418ab963b31e5f13a13 f5d581ec7fe8de66eb2f67c3c6161ace6e6c118cfe95fd069d1223b176345597 ce41bcd1afeccf32024f808cc166858603f37156f2e192fcf280ac5225844cbdcfc2bf4a76bddcb506fc8a3fc171f859ae51a12f297b7c7a96ae4a01f6f10bdb ccd0475e7f24651e9a692953247399e330f77eec
{"ft_lang_label":"__label__en","ft_lang_prob":0.60735506,"math_prob":0.98368245,"size":4638,"snap":"2021-31-2021-39","text_gpt3_token_len":1624,"char_repetition_ratio":0.12063012,"word_repetition_ratio":0.03362573,"special_character_ratio":0.4603277,"punctuation_ratio":0.07954545,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.995615,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-27T03:11:09Z\",\"WARC-Record-ID\":\"<urn:uuid:2e189cba-9137-43c0-ad43-64db2ee4c2df>\",\"Content-Length\":\"40698\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:305e2eff-4d29-4273-9a09-b58bd795cc37>\",\"WARC-Concurrent-To\":\"<urn:uuid:da0b5629-838b-4a45-ab39-e0a04821410b>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/131688\",\"WARC-Payload-Digest\":\"sha1:CVPCODTAKVQBMY6KEW4FUT4QYQOAYHAC\",\"WARC-Block-Digest\":\"sha1:JSHQJC2ZOMSG2MGYUQIXCDIXLQI3E26B\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780058263.20_warc_CC-MAIN-20210927030035-20210927060035-00622.warc.gz\"}"}