Base | Representation |
---|---|
bin | 101111001000010010… |
… | …110001100011010101 |
3 | 11211121202020121110221 |
4 | 233020102301203111 |
5 | 1312114340130023 |
6 | 35125252514341 |
7 | 3441016305523 |
oct | 571022614325 |
9 | 154552217427 |
10 | 50605005013 |
11 | 1a50922a2a2 |
12 | 998361b9b1 |
13 | 4a061cb764 |
14 | 2640c1b313 |
15 | 14b2a5085d |
hex | bc84b18d5 |
50605005013 has 2 divisors, whose sum is σ = 50605005014. Its totient is φ = 50605005012.
The previous prime is 50605004987. The next prime is 50605005019. The reversal of 50605005013 is 31050050605.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29416709169 + 21188295844 = 171513^2 + 145562^2 .
It is a cyclic number.
It is not a de Polignac number, because 50605005013 - 213 = 50604996821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50605005019) 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, 25302502506 + 25302502507.
It is an arithmetic number, because the mean of its divisors is an integer number (25302502507).
Almost surely, 250605005013 is an apocalyptic number.
It is an amenable number.
50605005013 is a deficient number, since it is larger than the sum of its proper divisors (1).
50605005013 is an equidigital number, since it uses as much as digits as its factorization.
50605005013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2250, while the sum is 25.
Adding to 50605005013 its reverse (31050050605), we get a palindrome (81655055618).
The spelling of 50605005013 in words is "fifty billion, six hundred five million, five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •