Base | Representation |
---|---|
bin | 10110110010010001110011… |
… | …01011001101110010110001 |
3 | 20120102002111012102121211211 |
4 | 23121020321223031302301 |
5 | 23031414200330331022 |
6 | 254322223203440121 |
7 | 13361020531430614 |
oct | 1331107153156261 |
9 | 216362435377754 |
10 | 50106056105137 |
11 | 14a6894a45565a |
12 | 5752a80986041 |
13 | 21c5c99b13686 |
14 | c53208ac017b |
15 | 5bd5908b5e77 |
hex | 2d9239acdcb1 |
50106056105137 has 2 divisors, whose sum is σ = 50106056105138. Its totient is φ = 50106056105136.
The previous prime is 50106056105069. The next prime is 50106056105191. The reversal of 50106056105137 is 73150165060105.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49126066982001 + 979989123136 = 7008999^2 + 989944^2 .
It is a cyclic number.
It is not a de Polignac number, because 50106056105137 - 27 = 50106056105009 is a prime.
It is a super-2 number, since 2×501060561051372 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50106056105137.
It is not a weakly prime, because it can be changed into another prime (50106056195137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25053028052568 + 25053028052569.
It is an arithmetic number, because the mean of its divisors is an integer number (25053028052569).
Almost surely, 250106056105137 is an apocalyptic number.
It is an amenable number.
50106056105137 is a deficient number, since it is larger than the sum of its proper divisors (1).
50106056105137 is an equidigital number, since it uses as much as digits as its factorization.
50106056105137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 94500, while the sum is 40.
The spelling of 50106056105137 in words is "fifty trillion, one hundred six billion, fifty-six million, one hundred five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •