Base | Representation |
---|---|
bin | 10110110010010001111001… |
… | …01001100100011001110111 |
3 | 20120102002121200022210202000 |
4 | 23121020330221210121313 |
5 | 23031414301114130421 |
6 | 254322232145150343 |
7 | 13361022005530602 |
oct | 1331107451443167 |
9 | 216362550283660 |
10 | 50106106005111 |
11 | 14a68975638202 |
12 | 5752a9562b3b3 |
13 | 21c5ca72653a0 |
14 | c5321158d339 |
15 | 5bd594e71226 |
hex | 2d923ca64677 |
50106106005111 has 32 divisors (see below), whose sum is σ = 79942119768000. Its totient is φ = 30834235920384.
The previous prime is 50106106005101. The next prime is 50106106005149. The reversal of 50106106005111 is 11150060160105.
50106106005111 is a `hidden beast` number, since 5 + 0 + 1 + 0 + 6 + 1 + 0 + 600 + 51 + 1 + 1 = 666.
It is not a de Polignac number, because 50106106005111 - 214 = 50106105988727 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50106106005101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40103895 + ... + 41334423.
It is an arithmetic number, because the mean of its divisors is an integer number (2498191242750).
Almost surely, 250106106005111 is an apocalyptic number.
50106106005111 is a deficient number, since it is larger than the sum of its proper divisors (29836013762889).
50106106005111 is a wasteful number, since it uses less digits than its factorization.
50106106005111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1346560 (or 1346554 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 27.
Adding to 50106106005111 its reverse (11150060160105), we get a palindrome (61256166165216).
The spelling of 50106106005111 in words is "fifty trillion, one hundred six billion, one hundred six million, five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •