# 52265 (number)

52,265 (fifty-two thousand two hundred sixty-five) is an odd five-digits composite number following 52264 and preceding 52266. In scientific notation, it is written as 5.2265 × 104. The sum of its digits is 20. It has a total of 2 prime factors and 4 positive divisors. There are 41,808 positive integers (up to 52265) that are relatively prime to 52265.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 5
• Sum of Digits 20
• Digital Root 2

## Name

Short name 52 thousand 265 fifty-two thousand two hundred sixty-five

## Notation

Scientific notation 5.2265 × 104 52.265 × 103

## Prime Factorization of 52265

Prime Factorization 5 × 10453

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 2 Total number of prime factors rad(n) 52265 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 52,265 is 5 × 10453. Since it has a total of 2 prime factors, 52,265 is a composite number.

## Divisors of 52265

1, 5, 10453, 52265

4 divisors

 Even divisors 0 4 4 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 4 Total number of the positive divisors of n σ(n) 62724 Sum of all the positive divisors of n s(n) 10459 Sum of the proper positive divisors of n A(n) 15681 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 228.615 Returns the nth root of the product of n divisors H(n) 3.33301 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 52,265 can be divided by 4 positive divisors (out of which 0 are even, and 4 are odd). The sum of these divisors (counting 52,265) is 62,724, the average is 15,681.

## Other Arithmetic Functions (n = 52265)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 41808 Total number of positive integers not greater than n that are coprime to n λ(n) 10452 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 5338 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 41,808 positive integers (less than 52,265) that are coprime with 52,265. And there are approximately 5,338 prime numbers less than or equal to 52,265.

## Divisibility of 52265

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

The number 52,265 is divisible by 5.

## Classification of 52265

• Arithmetic
• Semiprime
• Deficient

• Polite

• Square Free

### Other numbers

• LucasCarmichael

## Base conversion (52265)

Base System Value
2 Binary 1100110000101001
3 Ternary 2122200202
4 Quaternary 30300221
5 Quinary 3133030
6 Senary 1041545
8 Octal 146051
10 Decimal 52265
12 Duodecimal 262b5
36 Base36 14bt

## Basic calculations (n = 52265)

### Multiplication

n×y
 n×2 104530 156795 209060 261325

### Division

n÷y
 n÷2 26132.5 17421.7 13066.2 10453

### Exponentiation

ny
 n2 2731630225 142768653709625 7461803686133550625 389991169655770023415625

### Nth Root

y√n
 2√n 228.615 37.3884 15.12 8.78299

## 52265 as geometric shapes

### Circle

 Diameter 104530 328391 8.58167e+09

### Sphere

 Volume 5.98028e+14 3.43267e+10 328391

### Square

Length = n
 Perimeter 209060 2.73163e+09 73913.9

### Cube

Length = n
 Surface area 1.63898e+10 1.42769e+14 90525.6

### Equilateral Triangle

Length = n
 Perimeter 156795 1.18283e+09 45262.8

### Triangular Pyramid

Length = n
 Surface area 4.73132e+09 1.68254e+13 42674.2

## Cryptographic Hash Functions

md5 8854c4b809cf5e213b04411e959d1a0f fa24866c2c8a81dc8b7386d321bd844970173c99 a0d8e81471fad200a29d9692d0e741ff4af45e43c24df37688b47ebbd58f4080 7ab346f389312f4c54edb7aae6d0d60f2ef4edc3d6db001089155f4c7e7001afac0bc186bbea9dbd6dac0c4ed93695afbd78c5f270d3b311a1c3a6854b2e3320 6bda4a232a8331f97d57049e7f08675b08885ff7
{"ft_lang_label":"__label__en","ft_lang_prob":0.61173856,"math_prob":0.98666435,"size":4559,"snap":"2021-43-2021-49","text_gpt3_token_len":1624,"char_repetition_ratio":0.11899012,"word_repetition_ratio":0.028231798,"special_character_ratio":0.45075676,"punctuation_ratio":0.074742265,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9956748,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-04T04:44:11Z\",\"WARC-Record-ID\":\"<urn:uuid:132e246a-8c76-41b8-b37e-b830de3ba8fb>\",\"Content-Length\":\"39925\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:8171b0cd-3c64-4e20-b266-a9f93a5eccb6>\",\"WARC-Concurrent-To\":\"<urn:uuid:f7dd9031-e8ca-43e0-8e8a-6fadb52f12da>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/52265\",\"WARC-Payload-Digest\":\"sha1:TGSV3DJBC7WWX4FBVIKOWXGEG4FNOJJD\",\"WARC-Block-Digest\":\"sha1:NXJBRKPMYYIT6O3NU2FSPZ4K7L6XTNJA\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964362930.53_warc_CC-MAIN-20211204033320-20211204063320-00077.warc.gz\"}"}