## 5325

5,325 (five thousand three hundred twenty-five) is an odd four-digits composite number following 5324 and preceding 5326. In scientific notation, it is written as 5.325 × 103. The sum of its digits is 15. It has a total of 4 prime factors and 12 positive divisors. There are 2,800 positive integers (up to 5325) that are relatively prime to 5325.

## Basic properties

• Is Prime? No
• Number parity Odd
• Number length 4
• Sum of Digits 15
• Digital Root 6

## Name

Short name 5 thousand 325 five thousand three hundred twenty-five

## Notation

Scientific notation 5.325 × 103 5.325 × 103

## Prime Factorization of 5325

Prime Factorization 3 × 52 × 71

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

## Divisors of 5325

1, 3, 5, 15, 25, 71, 75, 213, 355, 1065, 1775, 5325

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) 8928 Sum of all the positive divisors of n s(n) 3603 Sum of the proper positive divisors of n A(n) 744 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 72.9726 Returns the nth root of the product of n divisors H(n) 7.15726 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 5,325 can be divided by 12 positive divisors (out of which 0 are even, and 12 are odd). The sum of these divisors (counting 5,325) is 8,928, the average is 744.

## Other Arithmetic Functions (n = 5325)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 2800 Total number of positive integers not greater than n that are coprime to n λ(n) 140 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 710 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 2,800 positive integers (less than 5,325) that are coprime with 5,325. And there are approximately 710 prime numbers less than or equal to 5,325.

## Divisibility of 5325

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

The number 5,325 is divisible by 3 and 5.

• Arithmetic
• Deficient

• Polite

## Base conversion (5325)

Base System Value
2 Binary 1010011001101
3 Ternary 21022020
4 Quaternary 1103031
5 Quinary 132300
6 Senary 40353
8 Octal 12315
10 Decimal 5325
12 Duodecimal 30b9
20 Vigesimal d65
36 Base36 43x

## Basic calculations (n = 5325)

### Multiplication

n×i
 n×2 10650 15975 21300 26625

### Division

ni
 n⁄2 2662.5 1775 1331.25 1065

### Exponentiation

ni
 n2 28355625 150993703125 804041469140625 4281520823173828125

### Nth Root

i√n
 2√n 72.9726 17.4625 8.5424 5.56242

## 5325 as geometric shapes

### Circle

 Diameter 10650 33458 8.90818e+07

### Sphere

 Volume 6.32481e+11 3.56327e+08 33458

### Square

Length = n
 Perimeter 21300 2.83556e+07 7530.69

### Cube

Length = n
 Surface area 1.70134e+08 1.50994e+11 9223.17

### Equilateral Triangle

Length = n
 Perimeter 15975 1.22783e+07 4611.59

### Triangular Pyramid

Length = n
 Surface area 4.91134e+07 1.77948e+10 4347.84
{"ft_lang_label":"__label__en","ft_lang_prob":0.6167096,"math_prob":0.9960182,"size":4390,"snap":"2020-24-2020-29","text_gpt3_token_len":1555,"char_repetition_ratio":0.11810306,"word_repetition_ratio":0.025487257,"special_character_ratio":0.44829157,"punctuation_ratio":0.07470511,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9987523,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-07-12T03:28:54Z\",\"WARC-Record-ID\":\"<urn:uuid:a3785560-4392-4bb3-9bf0-be5faebd1be7>\",\"Content-Length\":\"47443\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:49cc8d75-762a-43d7-a902-e0c5de12b43d>\",\"WARC-Concurrent-To\":\"<urn:uuid:2222ce3c-df2b-4f93-acda-247ba53ee21c>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/5325\",\"WARC-Payload-Digest\":\"sha1:YFVTNXWLDR43ARVEMEEQS332QJZBL5N3\",\"WARC-Block-Digest\":\"sha1:VDRNDKTSD4NJIQPZ6MWYZ7UJXHRB5ORW\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-29/CC-MAIN-2020-29_segments_1593657129517.82_warc_CC-MAIN-20200712015556-20200712045556-00064.warc.gz\"}"}