Base | Representation |
---|---|
bin | 101000110010000010001… |
… | …1001010000001011111001 |
3 | 201211211111111201212120012 |
4 | 1101210010121100023321 |
5 | 1213313023022100131 |
6 | 15530523151511305 |
7 | 1115643163223216 |
oct | 121440431201371 |
9 | 21754444655505 |
10 | 5605006050041 |
11 | 187108487a5a2 |
12 | 766355228535 |
13 | 31871bbbb058 |
14 | 1553d8824b0d |
15 | 9abebcdd52b |
hex | 519046502f9 |
5605006050041 has 2 divisors, whose sum is σ = 5605006050042. Its totient is φ = 5605006050040.
The previous prime is 5605006050013. The next prime is 5605006050047. The reversal of 5605006050041 is 1400506005065.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4275089681641 + 1329916368400 = 2067629^2 + 1153220^2 .
It is a cyclic number.
It is not a de Polignac number, because 5605006050041 - 210 = 5605006049017 is a prime.
It is a super-2 number, since 2×56050060500412 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (5605006050047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2802503025020 + 2802503025021.
It is an arithmetic number, because the mean of its divisors is an integer number (2802503025021).
Almost surely, 25605006050041 is an apocalyptic number.
It is an amenable number.
5605006050041 is a deficient number, since it is larger than the sum of its proper divisors (1).
5605006050041 is an equidigital number, since it uses as much as digits as its factorization.
5605006050041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18000, while the sum is 32.
The spelling of 5605006050041 in words is "five trillion, six hundred five billion, six million, fifty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •