# 213142 (number)

213,142 (two hundred thirteen thousand one hundred forty-two) is an even six-digits composite number following 213141 and preceding 213143. In scientific notation, it is written as 2.13142 × 105. The sum of its digits is 13. It has a total of 4 prime factors and 16 positive divisors. There are 98,280 positive integers (up to 213142) that are relatively prime to 213142.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 6
• Sum of Digits 13
• Digital Root 4

## Name

Short name 213 thousand 142 two hundred thirteen thousand one hundred forty-two

## Notation

Scientific notation 2.13142 × 105 213.142 × 103

## Prime Factorization of 213142

Prime Factorization 2 × 19 × 71 × 79

Composite number
Distinct Factors Total Factors Radical ω(n) 4 Total number of distinct prime factors Ω(n) 4 Total number of prime factors rad(n) 213142 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 213,142 is 2 × 19 × 71 × 79. Since it has a total of 4 prime factors, 213,142 is a composite number.

## Divisors of 213142

16 divisors

 Even divisors 8 8 4 4
Total Divisors Sum of Divisors Aliquot Sum τ(n) 16 Total number of the positive divisors of n σ(n) 345600 Sum of all the positive divisors of n s(n) 132458 Sum of the proper positive divisors of n A(n) 21600 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 461.673 Returns the nth root of the product of n divisors H(n) 9.86769 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 213,142 can be divided by 16 positive divisors (out of which 8 are even, and 8 are odd). The sum of these divisors (counting 213,142) is 345,600, the average is 21,600.

## Other Arithmetic Functions (n = 213142)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 98280 Total number of positive integers not greater than n that are coprime to n λ(n) 8190 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 19006 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 98,280 positive integers (less than 213,142) that are coprime with 213,142. And there are approximately 19,006 prime numbers less than or equal to 213,142.

## Divisibility of 213142

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

The number 213,142 is divisible by 2.

## Classification of 213142

• Arithmetic
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

## Base conversion (213142)

Base System Value
2 Binary 110100000010010110
3 Ternary 101211101011
4 Quaternary 310002112
5 Quinary 23310032
6 Senary 4322434
8 Octal 640226
10 Decimal 213142
12 Duodecimal a341a
20 Vigesimal 16ch2
36 Base36 4kgm

## Basic calculations (n = 213142)

### Multiplication

n×y
 n×2 426284 639426 852568 1065710

### Division

n÷y
 n÷2 106571 71047.3 53285.5 42628.4

### Exponentiation

ny
 n2 45429512164 9682937081659288 2063840575459023962896 439891107934487285499579232

### Nth Root

y√n
 2√n 461.673 59.7342 21.4866 11.6341

## 213142 as geometric shapes

### Circle

 Diameter 426284 1.33921e+06 1.42721e+11

### Sphere

 Volume 4.05598e+16 5.70884e+11 1.33921e+06

### Square

Length = n
 Perimeter 852568 4.54295e+10 301428

### Cube

Length = n
 Surface area 2.72577e+11 9.68294e+15 369173

### Equilateral Triangle

Length = n
 Perimeter 639426 1.96716e+10 184586

### Triangular Pyramid

Length = n
 Surface area 7.86862e+10 1.14115e+15 174030

## Cryptographic Hash Functions

md5 a1b82878ee964be19b7ca6ca84b17466 b8103763631f9afdf78379746a370de17f77c77f b2c1471941fea4395ebc827f2d8f4132f96a78e48595d5ed530f0c4722ca15c2 b42cb84b3c69274a89318ac0b21f1b786d65db295f500669b8da854f0695b0e73ab2f60f121fdeca55b838b71c82a44a1bd15c3dd74b4de40c6ef01cd951ec60 e53a5253795f2917fe9313cb1a2976c7420f6903
{"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}