# 211689 (number)

211,689 (two hundred eleven thousand six hundred eighty-nine) is an odd six-digits composite number following 211688 and preceding 211690. In scientific notation, it is written as 2.11689 × 105. The sum of its digits is 27. It has a total of 4 prime factors and 12 positive divisors. There are 137,592 positive integers (up to 211689) that are relatively prime to 211689.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 6
• Sum of Digits 27
• Digital Root 9

## Name

Short name 211 thousand 689 two hundred eleven thousand six hundred eighty-nine

## Notation

Scientific notation 2.11689 × 105 211.689 × 103

## Prime Factorization of 211689

Prime Factorization 32 × 43 × 547

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 4 Total number of prime factors rad(n) 70563 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 211,689 is 32 × 43 × 547. Since it has a total of 4 prime factors, 211,689 is a composite number.

## Divisors of 211689

12 divisors

 Even divisors 0 12 6 6
Total Divisors Sum of Divisors Aliquot Sum τ(n) 12 Total number of the positive divisors of n σ(n) 313456 Sum of all the positive divisors of n s(n) 101767 Sum of the proper positive divisors of n A(n) 26121.3 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 460.097 Returns the nth root of the product of n divisors H(n) 8.10407 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 211,689 can be divided by 12 positive divisors (out of which 0 are even, and 12 are odd). The sum of these divisors (counting 211,689) is 313,456, the average is 261,21.,333.

## Other Arithmetic Functions (n = 211689)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 137592 Total number of positive integers not greater than n that are coprime to n λ(n) 546 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 18888 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 137,592 positive integers (less than 211,689) that are coprime with 211,689. And there are approximately 18,888 prime numbers less than or equal to 211,689.

## Divisibility of 211689

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

The number 211,689 is divisible by 3 and 9.

## Classification of 211689

• Deficient

### Expressible via specific sums

• Polite
• Non-hypotenuse

## Base conversion (211689)

Base System Value
2 Binary 110011101011101001
3 Ternary 101202101100
4 Quaternary 303223221
5 Quinary 23233224
6 Senary 4312013
8 Octal 635351
10 Decimal 211689
12 Duodecimal a2609
20 Vigesimal 16949
36 Base36 4jc9

## Basic calculations (n = 211689)

### Multiplication

n×y
 n×2 423378 635067 846756 1058445

### Division

n÷y
 n÷2 105844 70563 52922.2 42337.8

### Exponentiation

ny
 n2 44812232721 9486256732475769 2008136201441063063841 425100344346857198921437449

### Nth Root

y√n
 2√n 460.097 59.5981 21.4499 11.6182

## 211689 as geometric shapes

### Circle

 Diameter 423378 1.33008e+06 1.40782e+11

### Sphere

 Volume 3.97359e+16 5.63127e+11 1.33008e+06

### Square

Length = n
 Perimeter 846756 4.48122e+10 299373

### Cube

Length = n
 Surface area 2.68873e+11 9.48626e+15 366656

### Equilateral Triangle

Length = n
 Perimeter 635067 1.94043e+10 183328

### Triangular Pyramid

Length = n
 Surface area 7.76171e+10 1.11797e+15 172843
{"ft_lang_label":"__label__en","ft_lang_prob":0.6014467,"math_prob":0.98680246,"size":4598,"snap":"2021-43-2021-49","text_gpt3_token_len":1619,"char_repetition_ratio":0.119721375,"word_repetition_ratio":0.02827381,"special_character_ratio":0.46107003,"punctuation_ratio":0.078104995,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9986839,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-04T17:03:13Z\",\"WARC-Record-ID\":\"<urn:uuid:3d8c9eff-618e-409a-afc4-d4f37c0e0ada>\",\"Content-Length\":\"39369\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:0516cd99-6365-4f96-96d9-91178456c7c0>\",\"WARC-Concurrent-To\":\"<urn:uuid:be875e1e-9ec3-4913-bd07-91e90d5b1006>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/211689\",\"WARC-Payload-Digest\":\"sha1:PYKSDCTS7C6ZPJJACHZI2P7YFQ2Z6C3D\",\"WARC-Block-Digest\":\"sha1:UZVLXN4H45GGENBFILYCDUFIO3HTKZ6B\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964362999.66_warc_CC-MAIN-20211204154554-20211204184554-00172.warc.gz\"}"}