Base | Representation |
---|---|
bin | 100100110000100111101… |
… | …1000010011100000101101 |
3 | 122212222122102200011200021 |
4 | 1021201033120103200231 |
5 | 1130233413101432113 |
6 | 14424542121002141 |
7 | 1031003361405163 |
oct | 111411730234055 |
9 | 18788572604607 |
10 | 5052213311533 |
11 | 16786a47812a3 |
12 | 6971a0023351 |
13 | 2a856354658b |
14 | 13675801b233 |
15 | 8b64656248d |
hex | 4984f61382d |
5052213311533 has 2 divisors, whose sum is σ = 5052213311534. Its totient is φ = 5052213311532.
The previous prime is 5052213311447. The next prime is 5052213311549. The reversal of 5052213311533 is 3351133122505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4793984693289 + 258228618244 = 2189517^2 + 508162^2 .
It is a cyclic number.
It is not a de Polignac number, because 5052213311533 - 213 = 5052213303341 is a prime.
It is a super-2 number, since 2×50522133115332 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5052213311333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2526106655766 + 2526106655767.
It is an arithmetic number, because the mean of its divisors is an integer number (2526106655767).
Almost surely, 25052213311533 is an apocalyptic number.
It is an amenable number.
5052213311533 is a deficient number, since it is larger than the sum of its proper divisors (1).
5052213311533 is an equidigital number, since it uses as much as digits as its factorization.
5052213311533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40500, while the sum is 34.
The spelling of 5052213311533 in words is "five trillion, fifty-two billion, two hundred thirteen million, three hundred eleven thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •