Base | Representation |
---|---|
bin | 101110101010001100… |
… | …110000001010111011 |
3 | 11210022120012021202001 |
4 | 232222030300022323 |
5 | 1310101112010021 |
6 | 35003215121431 |
7 | 3422345623450 |
oct | 565214601273 |
9 | 153276167661 |
10 | 50100110011 |
11 | 1a27a22a1a6 |
12 | 9862513277 |
13 | 4955721613 |
14 | 25d3b4d827 |
15 | 148356c091 |
hex | baa3302bb |
50100110011 has 16 divisors (see below), whose sum is σ = 59141468160. Its totient is φ = 41531545440.
The previous prime is 50100110009. The next prime is 50100110041. The reversal of 50100110011 is 11001100105.
50100110011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 50100110011 - 21 = 50100110009 is a prime.
It is a super-2 number, since 2×501001100112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
50100110011 is a modest number, since divided by 110011 gives 501 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 50100110011.
It is not an unprimeable number, because it can be changed into a prime (50100110041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 276885 + ... + 420553.
It is an arithmetic number, because the mean of its divisors is an integer number (3696341760).
Almost surely, 250100110011 is an apocalyptic number.
50100110011 is a deficient number, since it is larger than the sum of its proper divisors (9041358149).
50100110011 is a wasteful number, since it uses less digits than its factorization.
50100110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145314.
The product of its (nonzero) digits is 5, while the sum is 10.
Adding to 50100110011 its reverse (11001100105), we get a palindrome (61101210116).
The spelling of 50100110011 in words is "fifty billion, one hundred million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •