# 131903 (number)

131,903 (one hundred thirty-one thousand nine hundred three) is an odd six-digits composite number following 131902 and preceding 131904. In scientific notation, it is written as 1.31903 × 105. The sum of its digits is 17. It has a total of 2 prime factors and 4 positive divisors. There are 124,128 positive integers (up to 131903) that are relatively prime to 131903.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 6
• Sum of Digits 17
• Digital Root 8

## Name

Short name 131 thousand 903 one hundred thirty-one thousand nine hundred three

## Notation

Scientific notation 1.31903 × 105 131.903 × 103

## Prime Factorization of 131903

Prime Factorization 17 × 7759

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 2 Total number of prime factors rad(n) 131903 Product of the distinct prime numbers λ(n) 1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) 1 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,903 is 17 × 7759. Since it has a total of 2 prime factors, 131,903 is a composite number.

## Divisors of 131903

4 divisors

 Even divisors 0 4 2 2
Total Divisors Sum of Divisors Aliquot Sum τ(n) 4 Total number of the positive divisors of n σ(n) 139680 Sum of all the positive divisors of n s(n) 7777 Sum of the proper positive divisors of n A(n) 34920 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 363.185 Returns the nth root of the product of n divisors H(n) 3.77729 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 131,903 can be divided by 4 positive divisors (out of which 0 are even, and 4 are odd). The sum of these divisors (counting 131,903) is 139,680, the average is 34,920.

## Other Arithmetic Functions (n = 131903)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 124128 Total number of positive integers not greater than n that are coprime to n λ(n) 62064 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 12289 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 124,128 positive integers (less than 131,903) that are coprime with 131,903. And there are approximately 12,289 prime numbers less than or equal to 131,903.

## Divisibility of 131903

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

131,903 is not divisible by any number less than or equal to 9.

## Classification of 131903

• Arithmetic
• Semiprime
• Deficient

• Polite

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (131903)

Base System Value
2 Binary 100000001100111111
3 Ternary 20200221022
4 Quaternary 200030333
5 Quinary 13210103
6 Senary 2454355
8 Octal 401477
10 Decimal 131903
12 Duodecimal 643bb
20 Vigesimal g9f3
36 Base36 2trz

## Basic calculations (n = 131903)

### Multiplication

n×y
 n×2 263806 395709 527612 659515

### Division

n÷y
 n÷2 65951.5 43967.7 32975.8 26380.6

### Exponentiation

ny
 n2 17398401409 2294901341051327 302704371588693185281 39927614725663397218119743

### Nth Root

y√n
 2√n 363.185 50.904 19.0574 10.5694

## 131903 as geometric shapes

### Circle

 Diameter 263806 828771 5.46587e+10

### Sphere

 Volume 9.61286e+15 2.18635e+11 828771

### Square

Length = n
 Perimeter 527612 1.73984e+10 186539

### Cube

Length = n
 Surface area 1.0439e+11 2.2949e+15 228463

### Equilateral Triangle

Length = n
 Perimeter 395709 7.53373e+09 114231

### Triangular Pyramid

Length = n
 Surface area 3.01349e+10 2.70457e+14 107698

## Cryptographic Hash Functions

md5 2bfd946a638ffba7c38eda3282c46859 4e1ab4790a0e7604d3f58564ae7577a33b2059b8 385a6229dda97a7a9bbfd1e9bcc23e03824a847481bab281f3a7caf265b37002 4286732a8b0de5691edf8dbdd63cab224c28c50c18bb1e94fd92cf6f317a859bc6aaa3e578623e9afdf7b578bdeda74b50af75f00df2c1026e1144857b084f44 40ecb0a4420130c9889cc2909c8d0cb06706f090
{"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/131903", "fetch_time": 1632716302000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2021-39/segments/1631780058263.20/warc/CC-MAIN-20210927030035-20210927060035-00372.warc.gz", "warc_record_offset": 428084138, "warc_record_length": 7369, "token_count": 1443, "char_count": 4210, "score": 3.578125, "int_score": 4, "crawl": "CC-MAIN-2021-39", "snapshot_type": "latest", "language": "en", "language_score": 0.8093024492263794, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00061-of-00064.parquet"}