Base | Representation |
---|---|
bin | 1001100010011000… |
… | …00101110101110101 |
3 | 111012211121011010112 |
4 | 10301030011311311 |
5 | 40441234024113 |
6 | 2204024032405 |
7 | 240612104441 |
oct | 46114056565 |
9 | 14184534115 |
10 | 5120220533 |
11 | 219825a51a |
12 | baa902705 |
13 | 637a31cbc |
14 | 368037821 |
15 | 1ee7a25a8 |
hex | 131305d75 |
5120220533 has 2 divisors, whose sum is σ = 5120220534. Its totient is φ = 5120220532.
The previous prime is 5120220527. The next prime is 5120220559. The reversal of 5120220533 is 3350220215.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2990121124 + 2130099409 = 54682^2 + 46153^2 .
It is a cyclic number.
It is not a de Polignac number, because 5120220533 - 210 = 5120219509 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5120220499 and 5120220508.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5120220503) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2560110266 + 2560110267.
It is an arithmetic number, because the mean of its divisors is an integer number (2560110267).
Almost surely, 25120220533 is an apocalyptic number.
It is an amenable number.
5120220533 is a deficient number, since it is larger than the sum of its proper divisors (1).
5120220533 is an equidigital number, since it uses as much as digits as its factorization.
5120220533 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1800, while the sum is 23.
The square root of 5120220533 is about 71555.7162845848. The cubic root of 5120220533 is about 1723.5724977090.
Adding to 5120220533 its reverse (3350220215), we get a palindrome (8470440748).
The spelling of 5120220533 in words is "five billion, one hundred twenty million, two hundred twenty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •