# 214198 (number)

214,198 (two hundred fourteen thousand one hundred ninety-eight) is an even six-digits composite number following 214197 and preceding 214199. In scientific notation, it is written as 2.14198 × 105. The sum of its digits is 25. It has a total of 2 prime factors and 4 positive divisors. There are 107,098 positive integers (up to 214198) that are relatively prime to 214198.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 6
• Sum of Digits 25
• Digital Root 7

## Name

Short name 214 thousand 198 two hundred fourteen thousand one hundred ninety-eight

## Notation

Scientific notation 2.14198 × 105 214.198 × 103

## Prime Factorization of 214198

Prime Factorization 2 × 107099

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 2 Total number of prime factors rad(n) 214198 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 214,198 is 2 × 107099. Since it has a total of 2 prime factors, 214,198 is a composite number.

## Divisors of 214198

4 divisors

 Even divisors 2 2 1 1
Total Divisors Sum of Divisors Aliquot Sum τ(n) 4 Total number of the positive divisors of n σ(n) 321300 Sum of all the positive divisors of n s(n) 107102 Sum of the proper positive divisors of n A(n) 80325 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 462.815 Returns the nth root of the product of n divisors H(n) 2.66664 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 214,198 can be divided by 4 positive divisors (out of which 2 are even, and 2 are odd). The sum of these divisors (counting 214,198) is 321,300, the average is 80,325.

## Other Arithmetic Functions (n = 214198)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 107098 Total number of positive integers not greater than n that are coprime to n λ(n) 107098 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 19091 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 107,098 positive integers (less than 214,198) that are coprime with 214,198. And there are approximately 19,091 prime numbers less than or equal to 214,198.

## Divisibility of 214198

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

The number 214,198 is divisible by 2.

## Classification of 214198

• Arithmetic
• Semiprime
• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

• Square Free

## Base conversion (214198)

Base System Value
2 Binary 110100010010110110
3 Ternary 101212211021
4 Quaternary 310102312
5 Quinary 23323243
6 Senary 4331354
8 Octal 642266
10 Decimal 214198
12 Duodecimal a3b5a
20 Vigesimal 16f9i
36 Base36 4l9y

## Basic calculations (n = 214198)

### Multiplication

n×y
 n×2 428396 642594 856792 1070990

### Division

n÷y
 n÷2 107099 71399.3 53549.5 42839.6

### Exponentiation

ny
 n2 45880783204 9827572000730392 2105046267412448505616 450896700387211645005935968

### Nth Root

y√n
 2√n 462.815 59.8327 21.5131 11.6456

## 214198 as geometric shapes

### Circle

 Diameter 428396 1.34585e+06 1.44139e+11

### Sphere

 Volume 4.11656e+16 5.76555e+11 1.34585e+06

### Square

Length = n
 Perimeter 856792 4.58808e+10 302922

### Cube

Length = n
 Surface area 2.75285e+11 9.82757e+15 371002

### Equilateral Triangle

Length = n
 Perimeter 642594 1.9867e+10 185501

### Triangular Pyramid

Length = n
 Surface area 7.94678e+10 1.15819e+15 174892

## Cryptographic Hash Functions

md5 73b8a31aed7035b0267911340ed25a89 f1a82089922062dbc99df68fb2f9205f6c3db0fb eb15f957bdbd28110e6dcd9a4682adf0b33761b3b9d65eaf7ab0271e9cac47e0 749e6e91d346fb0051d91078b398f6a43a078bf9d883f0cd78235735e7bf4e0481723b3b754905575e09979ee405ec3eb96b9f7aa505f82e9fdcc8f368ce6064 52f7dc8c6355233255a18571715f35b21ac3e6d0
{"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/214198", "fetch_time": 1638846633000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2021-49/segments/1637964363332.1/warc/CC-MAIN-20211207014802-20211207044802-00290.warc.gz", "warc_record_offset": 453011467, "warc_record_length": 7339, "token_count": 1459, "char_count": 4229, "score": 3.5625, "int_score": 4, "crawl": "CC-MAIN-2021-49", "snapshot_type": "latest", "language": "en", "language_score": 0.8001787066459656, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00037-of-00064.parquet"}