Base | Representation |
---|---|
bin | 10110110010000110101101… |
… | …01010011110100101101111 |
3 | 20120101112010002222010202101 |
4 | 23121003112222132211233 |
5 | 23031320001100000421 |
6 | 254315400155435531 |
7 | 13360420116402130 |
oct | 1331032652364557 |
9 | 216345102863671 |
10 | 50100100000111 |
11 | 14a66373385807 |
12 | 575189a155ba7 |
13 | 21c555ab76285 |
14 | c52c01a59c87 |
15 | 5bd342a4e191 |
hex | 2d90d6a9e96f |
50100100000111 has 4 divisors (see below), whose sum is σ = 57257257142992. Its totient is φ = 42942942857232.
The previous prime is 50100100000061. The next prime is 50100100000163. The reversal of 50100100000111 is 11100000100105.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 50100100000111 - 223 = 50100091611503 is a prime.
It is a super-2 number, since 2×501001000001112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50100100300111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3578578571430 + ... + 3578578571443.
It is an arithmetic number, because the mean of its divisors is an integer number (14314314285748).
Almost surely, 250100100000111 is an apocalyptic number.
50100100000111 is a deficient number, since it is larger than the sum of its proper divisors (7157157142881).
50100100000111 is an equidigital number, since it uses as much as digits as its factorization.
50100100000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7157157142880.
The product of its (nonzero) digits is 5, while the sum is 10.
Adding to 50100100000111 its reverse (11100000100105), we get a palindrome (61200100100216).
The spelling of 50100100000111 in words is "fifty trillion, one hundred billion, one hundred million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •