# 216055 (number)

216,055 (two hundred sixteen thousand fifty-five) is an odd six-digits composite number following 216054 and preceding 216056. In scientific notation, it is written as 2.16055 × 105. The sum of its digits is 19. It has a total of 3 prime factors and 8 positive divisors. There are 148,128 positive integers (up to 216055) that are relatively prime to 216055.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 6
• Sum of Digits 19
• Digital Root 1

## Name

Short name 216 thousand 55 two hundred sixteen thousand fifty-five

## Notation

Scientific notation 2.16055 × 105 216.055 × 103

## Prime Factorization of 216055

Prime Factorization 5 × 7 × 6173

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 216055 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 216,055 is 5 × 7 × 6173. Since it has a total of 3 prime factors, 216,055 is a composite number.

## Divisors of 216055

8 divisors

 Even divisors 0 8 4 4
Total Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 296352 Sum of all the positive divisors of n s(n) 80297 Sum of the proper positive divisors of n A(n) 37044 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 464.817 Returns the nth root of the product of n divisors H(n) 5.83239 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 216,055 can be divided by 8 positive divisors (out of which 0 are even, and 8 are odd). The sum of these divisors (counting 216,055) is 296,352, the average is 37,044.

## Other Arithmetic Functions (n = 216055)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 148128 Total number of positive integers not greater than n that are coprime to n λ(n) 18516 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 19242 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 148,128 positive integers (less than 216,055) that are coprime with 216,055. And there are approximately 19,242 prime numbers less than or equal to 216,055.

## Divisibility of 216055

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

The number 216,055 is divisible by 5 and 7.

## Classification of 216055

• Arithmetic
• Deficient

• Polite

• Square Free

### Other numbers

• LucasCarmichael
• Sphenic

## Base conversion (216055)

Base System Value
2 Binary 110100101111110111
3 Ternary 101222101001
4 Quaternary 310233313
5 Quinary 23403210
6 Senary 4344131
8 Octal 645767
10 Decimal 216055
12 Duodecimal a5047
20 Vigesimal 1702f
36 Base36 4mpj

## Basic calculations (n = 216055)

### Multiplication

n×y
 n×2 432110 648165 864220 1080275

### Division

n÷y
 n÷2 108028 72018.3 54013.8 43211

### Exponentiation

ny
 n2 46679763025 10085396200366375 2179000276070157150625 470783904646337803178284375

### Nth Root

y√n
 2√n 464.817 60.0051 21.5596 11.6658

## 216055 as geometric shapes

### Circle

 Diameter 432110 1.35751e+06 1.46649e+11

### Sphere

 Volume 4.22456e+16 5.86595e+11 1.35751e+06

### Square

Length = n
 Perimeter 864220 4.66798e+10 305548

### Cube

Length = n
 Surface area 2.80079e+11 1.00854e+16 374218

### Equilateral Triangle

Length = n
 Perimeter 648165 2.02129e+10 187109

### Triangular Pyramid

Length = n
 Surface area 8.08517e+10 1.18858e+15 176408

## Cryptographic Hash Functions

md5 3271c9877efbd2156e62cdc25895e46f c9e9215448d348211204188a06c2e31803910357 6b25efe5619658f509f8350efab49864e94943d0bd92d1c857dc77770a8dcb3e ff94aff16e0dc3f85a70fd151438379c242f76b521c806758e530393af8ebc2c60cb3ba46c880147d3aa61b0fbed5477394228b86e405f5decbfa88a93f2a8ec 95a7282052d18fc7be3f419c630f44149b97cc00
{"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/216055", "fetch_time": 1638002641000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2021-49/segments/1637964358153.33/warc/CC-MAIN-20211127073536-20211127103536-00544.warc.gz", "warc_record_offset": 477694294, "warc_record_length": 7414, "token_count": 1444, "char_count": 4190, "score": 3.5625, "int_score": 4, "crawl": "CC-MAIN-2021-49", "snapshot_type": "latest", "language": "en", "language_score": 0.8134127259254456, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00026-of-00064.parquet"}