## 21465

21,465 (twenty-one thousand four hundred sixty-five) is an odd five-digits composite number following 21464 and preceding 21466. In scientific notation, it is written as 2.1465 × 104. The sum of its digits is 18. It has a total of 6 prime factors and 20 positive divisors. There are 11,232 positive integers (up to 21465) that are relatively prime to 21465.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 5
• Sum of Digits 18
• Digital Root 9

## Name

Short name 21 thousand 465 twenty-one thousand four hundred sixty-five

## Notation

Scientific notation 2.1465 × 104 21.465 × 103

## Prime Factorization of 21465

Prime Factorization 34 × 5 × 53

Composite number
Distinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 6 Total number of prime factors rad(n) 795 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,465 is 34 × 5 × 53. Since it has a total of 6 prime factors, 21,465 is a composite number.

## Divisors of 21465

1, 3, 5, 9, 15, 27, 45, 53, 81, 135, 159, 265, 405, 477, 795, 1431, 2385, 4293, 7155, 21465

20 divisors

 Even divisors 0 20 12 8
Total Divisors Sum of Divisors Aliquot Sum τ(n) 20 Total number of the positive divisors of n σ(n) 39204 Sum of all the positive divisors of n s(n) 17739 Sum of the proper positive divisors of n A(n) 1960.2 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 146.509 Returns the nth root of the product of n divisors H(n) 10.9504 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 21,465 can be divided by 20 positive divisors (out of which 0 are even, and 20 are odd). The sum of these divisors (counting 21,465) is 39,204, the average is 196,0.2.

## Other Arithmetic Functions (n = 21465)

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

There are 11,232 positive integers (less than 21,465) that are coprime with 21,465. And there are approximately 2,413 prime numbers less than or equal to 21,465.

## Divisibility of 21465

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

The number 21,465 is divisible by 3, 5 and 9.

• Deficient

• Polite

• Frugal

## Base conversion (21465)

Base System Value
2 Binary 101001111011001
3 Ternary 1002110000
4 Quaternary 11033121
5 Quinary 1141330
6 Senary 243213
8 Octal 51731
10 Decimal 21465
12 Duodecimal 10509
16 Hexadecimal 53d9
20 Vigesimal 2dd5
36 Base36 gk9

## Basic calculations (n = 21465)

### Multiplication

n×i
 n×2 42930 64395 85860 107325

### Division

ni
 n⁄2 10732.5 7155 5366.25 4293

### Exponentiation

ni
 n2 460746225 9889917719625 212287083851750625 4556742254877827165625

### Nth Root

i√n
 2√n 146.509 27.7914 12.1041 7.351

## 21465 as geometric shapes

### Circle

Radius = n
 Diameter 42930 134869 1.44748e+09

### Sphere

Radius = n
 Volume 4.14268e+13 5.78991e+09 134869

### Square

Length = n
 Perimeter 85860 4.60746e+08 30356.1

### Cube

Length = n
 Surface area 2.76448e+09 9.88992e+12 37178.5

### Equilateral Triangle

Length = n
 Perimeter 64395 1.99509e+08 18589.2

### Triangular Pyramid

Length = n
 Surface area 7.98036e+08 1.16554e+12 17526.1

## Cryptographic Hash Functions

md5 f4901fe9f7579de134a23723831738ac 809a3a88650fe5905c0328f1cff41cba615c08ec be388ce60955b1de290991d1154d71cfd3a02bb8f3d98ceeca0081d59f8aa852 aa032cb5d16ff32b91e849f460a48f5c578094e9a1c636be5397caa738d2d8902fdb8809e75b4e6bf1288484eae97f1d9f9bb9c3511cb289266a9d8f8f943586 3b05ef33e2df112efcf1b58cc24aa240eba41bbc
{"ft_lang_label":"__label__en","ft_lang_prob":0.61854815,"math_prob":0.9851166,"size":4474,"snap":"2021-21-2021-25","text_gpt3_token_len":1581,"char_repetition_ratio":0.12058166,"word_repetition_ratio":0.025373135,"special_character_ratio":0.4523916,"punctuation_ratio":0.07870968,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9959755,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-19T15:41:02Z\",\"WARC-Record-ID\":\"<urn:uuid:51063f21-3bfa-49cc-93af-9eba5fe50f5e>\",\"Content-Length\":\"59675\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2b6493c6-852f-4f4f-84b6-db97b8ebf591>\",\"WARC-Concurrent-To\":\"<urn:uuid:ff42cb0c-9d5f-4330-a3cd-642cd58a464f>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/21465\",\"WARC-Payload-Digest\":\"sha1:OZQGMMPRSQKUZBVGS5AMZRRE6QGILMES\",\"WARC-Block-Digest\":\"sha1:WZLSX43GADKQSMREXIRFU32RF67ULZUH\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623487648373.45_warc_CC-MAIN-20210619142022-20210619172022-00365.warc.gz\"}"}