Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …11100001011000011010001 |
3 | 20121222120211011121111222001 |
4 | 23133212313330023003101 |
5 | 23111210014331023212 |
6 | 255302334353314001 |
7 | 13435104622226332 |
oct | 1337466774130321 |
9 | 217876734544861 |
10 | 50550556111057 |
11 | 1511a409090052 |
12 | 5805052b65901 |
13 | 2228b878b0662 |
14 | c6a934d5c289 |
15 | 5c9e08d86657 |
hex | 2df9b7f0b0d1 |
50550556111057 has 2 divisors, whose sum is σ = 50550556111058. Its totient is φ = 50550556111056.
The previous prime is 50550556111039. The next prime is 50550556111061. The reversal of 50550556111057 is 75011165505505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49447350398161 + 1103205712896 = 7031881^2 + 1050336^2 .
It is a cyclic number.
It is not a de Polignac number, because 50550556111057 - 227 = 50550421893329 is a prime.
It is a super-3 number, since 3×505505561110573 (a number of 42 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50550556110998 and 50550556111016.
It is not a weakly prime, because it can be changed into another prime (50550556111007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25275278055528 + 25275278055529.
It is an arithmetic number, because the mean of its divisors is an integer number (25275278055529).
Almost surely, 250550556111057 is an apocalyptic number.
It is an amenable number.
50550556111057 is a deficient number, since it is larger than the sum of its proper divisors (1).
50550556111057 is an equidigital number, since it uses as much as digits as its factorization.
50550556111057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 656250, while the sum is 46.
The spelling of 50550556111057 in words is "fifty trillion, five hundred fifty billion, five hundred fifty-six million, one hundred eleven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •