Base | Representation |
---|---|
bin | 100100110000001001111… |
… | …1001010011101110011001 |
3 | 122212220001212210110122201 |
4 | 1021200103321103232121 |
5 | 1130224342111031301 |
6 | 14424255110450201 |
7 | 1030636552612465 |
oct | 111402371235631 |
9 | 18786055713581 |
10 | 5051215330201 |
11 | 1678232407137 |
12 | 696b61963961 |
13 | 2a8434865191 |
14 | 1366a16774a5 |
15 | 8b5d8b2e201 |
hex | 49813e53b99 |
5051215330201 has 2 divisors, whose sum is σ = 5051215330202. Its totient is φ = 5051215330200.
The previous prime is 5051215330171. The next prime is 5051215330229. The reversal of 5051215330201 is 1020335121505.
It is an a-pointer prime, because the next prime (5051215330229) can be obtained adding 5051215330201 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4868223024025 + 182992306176 = 2206405^2 + 427776^2 .
It is a cyclic number.
It is not a de Polignac number, because 5051215330201 - 25 = 5051215330169 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5051215330201.
It is not a weakly prime, because it can be changed into another prime (5051215360201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2525607665100 + 2525607665101.
It is an arithmetic number, because the mean of its divisors is an integer number (2525607665101).
Almost surely, 25051215330201 is an apocalyptic number.
It is an amenable number.
5051215330201 is a deficient number, since it is larger than the sum of its proper divisors (1).
5051215330201 is an equidigital number, since it uses as much as digits as its factorization.
5051215330201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 28.
The spelling of 5051215330201 in words is "five trillion, fifty-one billion, two hundred fifteen million, three hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •