# 131196 (number)

131,196 (one hundred thirty-one thousand one hundred ninety-six) is an even six-digits composite number following 131195 and preceding 131197. In scientific notation, it is written as 1.31196 × 105. The sum of its digits is 21. It has a total of 6 prime factors and 36 positive divisors. There are 38,976 positive integers (up to 131196) that are relatively prime to 131196.

## Basic properties

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

## Name

Short name 131 thousand 196 one hundred thirty-one thousand one hundred ninety-six

## Notation

Scientific notation 1.31196 × 105 131.196 × 103

## Prime Factorization of 131196

Prime Factorization 22 × 3 × 13 × 292

Composite number
Distinct Factors Total Factors Radical ω(n) 4 Total number of distinct prime factors Ω(n) 6 Total number of prime factors rad(n) 2262 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,196 is 22 × 3 × 13 × 292. Since it has a total of 6 prime factors, 131,196 is a composite number.

## Divisors of 131196

36 divisors

 Even divisors 24 12 6 6
Total Divisors Sum of Divisors Aliquot Sum τ(n) 36 Total number of the positive divisors of n σ(n) 341432 Sum of all the positive divisors of n s(n) 210236 Sum of the proper positive divisors of n A(n) 9484.22 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 362.21 Returns the nth root of the product of n divisors H(n) 13.8331 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 131,196 can be divided by 36 positive divisors (out of which 24 are even, and 12 are odd). The sum of these divisors (counting 131,196) is 341,432, the average is 94,84.,222.

## Other Arithmetic Functions (n = 131196)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 38976 Total number of positive integers not greater than n that are coprime to n λ(n) 2436 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 12229 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 38,976 positive integers (less than 131,196) that are coprime with 131,196. And there are approximately 12,229 prime numbers less than or equal to 131,196.

## Divisibility of 131196

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

The number 131,196 is divisible by 2, 3, 4 and 6.

• Abundant

• Polite
• Practical

## Base conversion (131196)

Base System Value
2 Binary 100000000001111100
3 Ternary 20122222010
4 Quaternary 200001330
5 Quinary 13144241
6 Senary 2451220
8 Octal 400174
10 Decimal 131196
12 Duodecimal 63b10
20 Vigesimal g7jg
36 Base36 2t8c

## Basic calculations (n = 131196)

### Multiplication

n×y
 n×2 262392 393588 524784 655980

### Division

n÷y
 n÷2 65598 43732 32799 26239.2

### Exponentiation

ny
 n2 17212390416 2258196773017536 296266383832808653056 38868964493329164046334976

### Nth Root

y√n
 2√n 362.21 50.8128 19.0318 10.5581

## 131196 as geometric shapes

### Circle

 Diameter 262392 824329 5.40743e+10

### Sphere

 Volume 9.45911e+15 2.16297e+11 824329

### Square

Length = n
 Perimeter 524784 1.72124e+10 185539

### Cube

Length = n
 Surface area 1.03274e+11 2.2582e+15 227238

### Equilateral Triangle

Length = n
 Perimeter 393588 7.45318e+09 113619

### Triangular Pyramid

Length = n
 Surface area 2.98127e+10 2.66131e+14 107121

## Cryptographic Hash Functions

md5 6eef0821bbe4379821cf30009d0d754c 88ce3d812b83a3423d65738031348ecc9778ac3d 6b3cb56cf9dc50a599a837317e27cb1056b7d7206d716170acedfccbc38dee25 a588c221755ad56005f58efcdb62d5df3cef0aa10b08642055696d0714bdd6b354d2b2f02e594bf3468cde2a6f494ff5b7672fb84439a01408a3fec718503513 017cc979cfaa415415762a00a4ae233b70283f72
{"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, "url": "https://metanumbers.com/131196", "fetch_time": 1632814519000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2021-39/segments/1631780060538.11/warc/CC-MAIN-20210928062408-20210928092408-00166.warc.gz", "warc_record_offset": 418748434, "warc_record_length": 7567, "token_count": 1421, "char_count": 4130, "score": 3.71875, "int_score": 4, "crawl": "CC-MAIN-2021-39", "snapshot_type": "latest", "language": "en", "language_score": 0.8101775050163269, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00028-of-00064.parquet"}