## 5209

5,209 (five thousand two hundred nine) is an odd four-digits prime number following 5208 and preceding 5210. In scientific notation, it is written as 5.209 × 103. The sum of its digits is 16. It has a total of 1 prime factor and 2 positive divisors. There are 5,208 positive integers (up to 5209) that are relatively prime to 5209.

## Basic properties

• Is Prime? Yes
• Number parity Odd
• Number length 4
• Sum of Digits 16
• Digital Root 7

## Name

Short name 5 thousand 209 five thousand two hundred nine

## Notation

Scientific notation 5.209 × 103 5.209 × 103

## Prime Factorization of 5209

Prime Factorization 5209

Prime number
Distinct Factors Total Factors Radical ω(n) 1 Total number of distinct prime factors Ω(n) 1 Total number of prime factors rad(n) 5209 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) 8.55814 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,209 is 5209. Since it has a total of 1 prime factor, 5,209 is a prime number.

## Divisors of 5209

2 divisors

 Even divisors 0 2 2 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 2 Total number of the positive divisors of n σ(n) 5210 Sum of all the positive divisors of n s(n) 1 Sum of the proper positive divisors of n A(n) 2605 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 72.1734 Returns the nth root of the product of n divisors H(n) 1.99962 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 5,209 can be divided by 2 positive divisors (out of which 0 are even, and 2 are odd). The sum of these divisors (counting 5,209) is 5,210, the average is 2,605.

## Other Arithmetic Functions (n = 5209)

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

There are 5,208 positive integers (less than 5,209) that are coprime with 5,209. And there are approximately 697 prime numbers less than or equal to 5,209.

## Divisibility of 5209

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

5,209 is not divisible by any number less than or equal to 9.

• Arithmetic
• Prime
• Deficient

• Polite

• Prime Power
• Square Free

## Base conversion (5209)

Base System Value
2 Binary 1010001011001
3 Ternary 21010221
4 Quaternary 1101121
5 Quinary 131314
6 Senary 40041
8 Octal 12131
10 Decimal 5209
12 Duodecimal 3021
20 Vigesimal d09
36 Base36 40p

## Basic calculations (n = 5209)

### Multiplication

n×i
 n×2 10418 15627 20836 26045

### Division

ni
 n⁄2 2604.5 1736.33 1302.25 1041.8

### Exponentiation

ni
 n2 27133681 141339344329 736236644609761 3835056681772245049

### Nth Root

i√n
 2√n 72.1734 17.3348 8.49549 5.53797

## 5209 as geometric shapes

### Circle

 Diameter 10418 32729.1 8.5243e+07

### Sphere

 Volume 5.92041e+11 3.40972e+08 32729.1

### Square

Length = n
 Perimeter 20836 2.71337e+07 7366.64

### Cube

Length = n
 Surface area 1.62802e+08 1.41339e+11 9022.25

### Equilateral Triangle

Length = n
 Perimeter 15627 1.17492e+07 4511.13

### Triangular Pyramid

Length = n
 Surface area 4.69969e+07 1.6657e+10 4253.13
{"ft_lang_label":"__label__en","ft_lang_prob":0.627589,"math_prob":0.98809904,"size":4423,"snap":"2020-34-2020-40","text_gpt3_token_len":1571,"char_repetition_ratio":0.11971034,"word_repetition_ratio":0.029717682,"special_character_ratio":0.44426858,"punctuation_ratio":0.07642487,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9990939,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-08-05T14:00:48Z\",\"WARC-Record-ID\":\"<urn:uuid:4a090c47-8ec8-4c6a-bba6-902691e0cb23>\",\"Content-Length\":\"47672\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:bb7af1d5-d7ff-41bf-9fdd-068744891744>\",\"WARC-Concurrent-To\":\"<urn:uuid:9823db5e-30f7-4f21-8bb4-824a5e069e83>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/5209\",\"WARC-Payload-Digest\":\"sha1:OLZ4O3GX5AHLAQYLNRQXJG2LYBRL4K5K\",\"WARC-Block-Digest\":\"sha1:DTF5QHHUMOE6TWNAFFW7AUEY66FZDGOY\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-34/CC-MAIN-2020-34_segments_1596439735958.84_warc_CC-MAIN-20200805124104-20200805154104-00245.warc.gz\"}"}