Base | Representation |
---|---|
bin | 100101001011110101101… |
… | …1000100101000101001001 |
3 | 200002120112001012222011222 |
4 | 1022113223120211011021 |
5 | 1132213120243012131 |
6 | 14511450203531425 |
7 | 1035143022322025 |
oct | 112275330450511 |
9 | 20076461188158 |
10 | 5110665204041 |
11 | 16a046a300281 |
12 | 6a6593529b75 |
13 | 2b0c1a339617 |
14 | 139501047385 |
15 | 8ce17e1687b |
hex | 4a5eb625149 |
5110665204041 has 2 divisors, whose sum is σ = 5110665204042. Its totient is φ = 5110665204040.
The previous prime is 5110665204023. The next prime is 5110665204077. The reversal of 5110665204041 is 1404025660115.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5067721345600 + 42943858441 = 2251160^2 + 207229^2 .
It is a cyclic number.
It is not a de Polignac number, because 5110665204041 - 234 = 5093485334857 is a prime.
It is a super-2 number, since 2×51106652040412 (a number of 26 digits) contains 22 as substring.
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 = 5110665203992 and 5110665204010.
It is not a weakly prime, because it can be changed into another prime (5110665200041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2555332602020 + 2555332602021.
It is an arithmetic number, because the mean of its divisors is an integer number (2555332602021).
Almost surely, 25110665204041 is an apocalyptic number.
It is an amenable number.
5110665204041 is a deficient number, since it is larger than the sum of its proper divisors (1).
5110665204041 is an equidigital number, since it uses as much as digits as its factorization.
5110665204041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28800, while the sum is 35.
The spelling of 5110665204041 in words is "five trillion, one hundred ten billion, six hundred sixty-five million, two hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.184 sec. • engine limits •