Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …00101000101110001100101 |
3 | 20121222120210202020002122202 |
4 | 23133212313211011301211 |
5 | 23111210011303411013 |
6 | 255302334015504245 |
7 | 13435104516625214 |
oct | 1337466745056145 |
9 | 217876722202582 |
10 | 50550550060133 |
11 | 1511a405727992 |
12 | 5805050b28085 |
13 | 2228b86572426 |
14 | c6a93422507b |
15 | 5c9e0858d858 |
hex | 2df9b7945c65 |
50550550060133 has 2 divisors, whose sum is σ = 50550550060134. Its totient is φ = 50550550060132.
The previous prime is 50550550060091. The next prime is 50550550060247. The reversal of 50550550060133 is 33106005505505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 32079276116449 + 18471273943684 = 5663857^2 + 4297822^2 .
It is a cyclic number.
It is not a de Polignac number, because 50550550060133 - 26 = 50550550060069 is a prime.
It is a super-2 number, since 2×505505500601332 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50550550060333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25275275030066 + 25275275030067.
It is an arithmetic number, because the mean of its divisors is an integer number (25275275030067).
Almost surely, 250550550060133 is an apocalyptic number.
It is an amenable number.
50550550060133 is a deficient number, since it is larger than the sum of its proper divisors (1).
50550550060133 is an equidigital number, since it uses as much as digits as its factorization.
50550550060133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168750, while the sum is 38.
Adding to 50550550060133 its reverse (33106005505505), we get a palindrome (83656555565638).
The spelling of 50550550060133 in words is "fifty trillion, five hundred fifty billion, five hundred fifty million, sixty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •