Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …00101000101110011100101 |
3 | 20121222120210202020002211111 |
4 | 23133212313211011303211 |
5 | 23111210011303412021 |
6 | 255302334015505021 |
7 | 13435104516625456 |
oct | 1337466745056345 |
9 | 217876722202744 |
10 | 50550550060261 |
11 | 1511a405727a99 |
12 | 5805050b28171 |
13 | 2228b865724c4 |
14 | c6a93422512d |
15 | 5c9e0858d8e1 |
hex | 2df9b7945ce5 |
50550550060261 has 2 divisors, whose sum is σ = 50550550060262. Its totient is φ = 50550550060260.
The previous prime is 50550550060247. The next prime is 50550550060277. The reversal of 50550550060261 is 16206005505505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 42816005039236 + 7734545021025 = 6543394^2 + 2781105^2 .
It is a cyclic number.
It is not a de Polignac number, because 50550550060261 - 27 = 50550550060133 is a prime.
It is a super-2 number, since 2×505505500602612 (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 (50550550060961) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25275275030130 + 25275275030131.
It is an arithmetic number, because the mean of its divisors is an integer number (25275275030131).
Almost surely, 250550550060261 is an apocalyptic number.
It is an amenable number.
50550550060261 is a deficient number, since it is larger than the sum of its proper divisors (1).
50550550060261 is an equidigital number, since it uses as much as digits as its factorization.
50550550060261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 225000, while the sum is 40.
Adding to 50550550060261 its reverse (16206005505505), we get a palindrome (66756555565766).
The spelling of 50550550060261 in words is "fifty trillion, five hundred fifty billion, five hundred fifty million, sixty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •