## 21382260

21,382,260 (twenty-one million three hundred eighty-two thousand two hundred sixty) is an even eight-digits composite number following 21382259 and preceding 21382261. In scientific notation, it is written as 2.138226 × 107. The sum of its digits is 24. It has a total of 6 prime factors and 48 positive divisors. There are 5,366,272 positive integers (up to 21382260) that are relatively prime to 21382260.

## Basic properties

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

## Name

Short name 21 million 382 thousand 260 twenty-one million three hundred eighty-two thousand two hundred sixty

## Notation

Scientific notation 2.138226 × 107 21.38226 × 106

## Prime Factorization of 21382260

Prime Factorization 22 × 3 × 5 × 17 × 20963

Composite number
Distinct Factors Total Factors Radical ω(n) 5 Total number of distinct prime factors Ω(n) 6 Total number of prime factors rad(n) 10691130 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 21,382,260 is 22 × 3 × 5 × 17 × 20963. Since it has a total of 6 prime factors, 21,382,260 is a composite number.

## Divisors of 21382260

48 divisors

 Even divisors 32 16 8 8
Total Divisors Sum of Divisors Aliquot Sum τ(n) 48 Total number of the positive divisors of n σ(n) 6.33951e+07 Sum of all the positive divisors of n s(n) 4.20129e+07 Sum of the proper positive divisors of n A(n) 1.32073e+06 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 4624.1 Returns the nth root of the product of n divisors H(n) 16.1897 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 21,382,260 can be divided by 48 positive divisors (out of which 32 are even, and 16 are odd). The sum of these divisors (counting 21,382,260) is 63,395,136, the average is 1,320,732.

## Other Arithmetic Functions (n = 21382260)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 5366272 Total number of positive integers not greater than n that are coprime to n λ(n) 167696 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 1350466 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 5,366,272 positive integers (less than 21,382,260) that are coprime with 21,382,260. And there are approximately 1,350,466 prime numbers less than or equal to 21,382,260.

## Divisibility of 21382260

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

The number 21,382,260 is divisible by 2, 3, 4, 5 and 6.

• Arithmetic
• Abundant

• Polite

## Base conversion (21382260)

Base System Value
2 Binary 1010001100100010001110100
3 Ternary 1111020022221120
4 Quaternary 1101210101310
5 Quinary 20433213020
6 Senary 2042143540
8 Octal 121442164
10 Decimal 21382260
12 Duodecimal 71b1bb0
20 Vigesimal 6dcfd0
36 Base36 cqano

## Basic calculations (n = 21382260)

### Multiplication

n×i
 n×2 42764520 64146780 85529040 106911300

### Division

ni
 n⁄2 1.06911e+07 7.12742e+06 5.34556e+06 4.27645e+06

### Exponentiation

ni
 n2 457201042707600 9775991567445007176000 209032793452916679139097760000 4469593538136562191688764469737600000

### Nth Root

i√n
 2√n 4624.1 277.556 68.0007 29.2422

## 21382260 as geometric shapes

### Circle

 Diameter 4.27645e+07 1.34349e+08 1.43634e+15

### Sphere

 Volume 4.09496e+22 5.74536e+15 1.34349e+08

### Square

Length = n
 Perimeter 8.5529e+07 4.57201e+14 3.02391e+07

### Cube

Length = n
 Surface area 2.74321e+15 9.77599e+21 3.70352e+07

### Equilateral Triangle

Length = n
 Perimeter 6.41468e+07 1.97974e+14 1.85176e+07

### Triangular Pyramid

Length = n
 Surface area 7.91895e+14 1.15211e+21 1.74585e+07

## Cryptographic Hash Functions

md5 45cfe4987fc0683b4901ed034bbbf411 98ff94d5174d459c4135f0db31bb83c19e176440 937d40021fb2a54dbd0a344dd97fc4caf4163e5932c2edeb165cabd2f1598b7e 8e4e06e3b5c2e3662f5675227579d87b92a5179f6a653358694ddfd49eb92934ccf7e7ab030dfcda5e33b1c3fb38cfc6a33122e6eefcaa766e86ed49f730cb75 6695738d0eb90a0151a000efcedf7c00c61883a1
{"ft_lang_label":"__label__en","ft_lang_prob":0.61523795,"math_prob":0.98376745,"size":4843,"snap":"2020-34-2020-40","text_gpt3_token_len":1732,"char_repetition_ratio":0.12089275,"word_repetition_ratio":0.04505814,"special_character_ratio":0.48151973,"punctuation_ratio":0.09322034,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99545807,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-20T20:31:06Z\",\"WARC-Record-ID\":\"<urn:uuid:cfe77acd-8d2d-4af4-938f-6aad001f8ab5>\",\"Content-Length\":\"49181\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3770b156-bde9-4a6f-ab64-e36b0ca28445>\",\"WARC-Concurrent-To\":\"<urn:uuid:c2ff1c7b-1b08-4476-a7a9-e7952cb8e9dd>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/21382260\",\"WARC-Payload-Digest\":\"sha1:GXEQU5TCWP3S6JCWAA5RIA676IW4QVV5\",\"WARC-Block-Digest\":\"sha1:LLICTPU3LBHKKSUM3TEQBR5QAJIBOQMP\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600400198652.6_warc_CC-MAIN-20200920192131-20200920222131-00517.warc.gz\"}"}