Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …00101000101110011010111 |
3 | 20121222120210202020002210222 |
4 | 23133212313211011303113 |
5 | 23111210011303411442 |
6 | 255302334015504555 |
7 | 13435104516625436 |
oct | 1337466745056327 |
9 | 217876722202728 |
10 | 50550550060247 |
11 | 1511a405727a86 |
12 | 5805050b2815b |
13 | 2228b865724b3 |
14 | c6a93422511d |
15 | 5c9e0858d8d2 |
hex | 2df9b7945cd7 |
50550550060247 has 2 divisors, whose sum is σ = 50550550060248. Its totient is φ = 50550550060246.
The previous prime is 50550550060133. The next prime is 50550550060261. The reversal of 50550550060247 is 74206005505505.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 50550550060247 - 214 = 50550550043863 is a prime.
It is a super-2 number, since 2×505505500602472 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50550550060198 and 50550550060207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50550550060277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25275275030123 + 25275275030124.
It is an arithmetic number, because the mean of its divisors is an integer number (25275275030124).
Almost surely, 250550550060247 is an apocalyptic number.
50550550060247 is a deficient number, since it is larger than the sum of its proper divisors (1).
50550550060247 is an equidigital number, since it uses as much as digits as its factorization.
50550550060247 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1050000, while the sum is 44.
The spelling of 50550550060247 in words is "fifty trillion, five hundred fifty billion, five hundred fifty million, sixty thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •