Base | Representation |
---|---|
bin | 10111000101110101110001… |
… | …11001010010111111100101 |
3 | 20122210100102102220122221101 |
4 | 23202322320321102333211 |
5 | 23123422231040313221 |
6 | 255555104023520101 |
7 | 13460414160245305 |
oct | 1342727071227745 |
9 | 218710372818841 |
10 | 50778205401061 |
11 | 151a7a09189046 |
12 | 58411a62b9031 |
13 | 2244497276158 |
14 | c7796d1b9605 |
15 | 5d0cce897d91 |
hex | 2e2eb8e52fe5 |
50778205401061 has 2 divisors, whose sum is σ = 50778205401062. Its totient is φ = 50778205401060.
The previous prime is 50778205401047. The next prime is 50778205401067. The reversal of 50778205401061 is 16010450287705.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 41787239133025 + 8990966268036 = 6464305^2 + 2998494^2 .
It is a cyclic number.
It is not a de Polignac number, because 50778205401061 - 217 = 50778205269989 is a prime.
It is a super-2 number, since 2×507782054010612 (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 (50778205401067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25389102700530 + 25389102700531.
It is an arithmetic number, because the mean of its divisors is an integer number (25389102700531).
Almost surely, 250778205401061 is an apocalyptic number.
It is an amenable number.
50778205401061 is a deficient number, since it is larger than the sum of its proper divisors (1).
50778205401061 is an equidigital number, since it uses as much as digits as its factorization.
50778205401061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 470400, while the sum is 46.
Adding to 50778205401061 its reverse (16010450287705), we get a palindrome (66788655688766).
The spelling of 50778205401061 in words is "fifty trillion, seven hundred seventy-eight billion, two hundred five million, four hundred one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •