213650 (number)

213,650 (two hundred thirteen thousand six hundred fifty) is an even six-digits composite number following 213649 and preceding 213651. In scientific notation, it is written as 2.1365 × 105. The sum of its digits is 17. It has a total of 4 prime factors and 12 positive divisors. There are 85,440 positive integers (up to 213650) that are relatively prime to 213650.

Basic properties

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

Name

Short name 213 thousand 650 two hundred thirteen thousand six hundred fifty

Notation

Scientific notation 2.1365 × 105 213.65 × 103

Prime Factorization of 213650

Prime Factorization 2 × 52 × 4273

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 4 Total number of prime factors rad(n) 42730 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 213,650 is 2 × 52 × 4273. Since it has a total of 4 prime factors, 213,650 is a composite number.

Divisors of 213650

12 divisors

 Even divisors 6 6 6 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 12 Total number of the positive divisors of n σ(n) 397482 Sum of all the positive divisors of n s(n) 183832 Sum of the proper positive divisors of n A(n) 33123.5 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 462.223 Returns the nth root of the product of n divisors H(n) 6.4501 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 213,650 can be divided by 12 positive divisors (out of which 6 are even, and 6 are odd). The sum of these divisors (counting 213,650) is 397,482, the average is 3,312,3.5.

Other Arithmetic Functions (n = 213650)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 85440 Total number of positive integers not greater than n that are coprime to n λ(n) 21360 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 19047 Total number of primes less than or equal to n r2(n) 24 The number of ways n can be represented as the sum of 2 squares

There are 85,440 positive integers (less than 213,650) that are coprime with 213,650. And there are approximately 19,047 prime numbers less than or equal to 213,650.

Divisibility of 213650

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

The number 213,650 is divisible by 2 and 5.

• Deficient

• Polite

Base conversion (213650)

Base System Value
2 Binary 110100001010010010
3 Ternary 101212001222
4 Quaternary 310022102
5 Quinary 23314100
6 Senary 4325042
8 Octal 641222
10 Decimal 213650
12 Duodecimal a3782
20 Vigesimal 16e2a
36 Base36 4kuq

Basic calculations (n = 213650)

Multiplication

n×y
 n×2 427300 640950 854600 1068250

Division

n÷y
 n÷2 106825 71216.7 53412.5 42730

Exponentiation

ny
 n2 45646322500 9752336802125000 2083586757774006250000 445158310798416435312500000

Nth Root

y√n
 2√n 462.223 59.7816 21.4994 11.6397

213650 as geometric shapes

Circle

 Diameter 427300 1.3424e+06 1.43402e+11

Sphere

 Volume 4.08505e+16 5.73609e+11 1.3424e+06

Square

Length = n
 Perimeter 854600 4.56463e+10 302147

Cube

Length = n
 Surface area 2.73878e+11 9.75234e+15 370053

Equilateral Triangle

Length = n
 Perimeter 640950 1.97654e+10 185026

Triangular Pyramid

Length = n
 Surface area 7.90617e+10 1.14932e+15 174444

Cryptographic Hash Functions

md5 3a250d494332149661000330727747f8 ec3edaa211cc5a92fa9f951fca92ef59296e29fe 0679403977db1dbf803e91a668d4fb806661e446c3884e31131acc230a07943e c3bb1b11c1459483405440286deec83d48221de367af5da55e27fbefa0be412bb17876862eb8bf1075d1d77a9ca59c4044b2b782ebb46aab4e2295acf78182fd 0de6f4e0c6e263515c96592607681e081c14b7bf
{"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}