Base | Representation |
---|---|
bin | 101110100100010011… |
… | …000011110011101011 |
3 | 11210001122220001120000 |
4 | 232210103003303223 |
5 | 1304400240200021 |
6 | 34545321034043 |
7 | 3420034223532 |
oct | 564423036353 |
9 | 153048801500 |
10 | 50001100011 |
11 | 1a229354555 |
12 | 9835325923 |
13 | 493b066615 |
14 | 25c4939319 |
15 | 1479a10b26 |
hex | ba44c3ceb |
50001100011 has 10 divisors (see below), whose sum is σ = 74693001372. Its totient is φ = 33334066620.
The previous prime is 50001100007. The next prime is 50001100031. The reversal of 50001100011 is 11000110005.
It is not a de Polignac number, because 50001100011 - 22 = 50001100007 is a prime.
It is a super-2 number, since 2×500011000112 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 50001099966 and 50001100002.
It is not an unprimeable number, because it can be changed into a prime (50001100031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 308648685 + ... + 308648846.
Almost surely, 250001100011 is an apocalyptic number.
50001100011 is a deficient number, since it is larger than the sum of its proper divisors (24691901361).
50001100011 is an equidigital number, since it uses as much as digits as its factorization.
50001100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 617297543 (or 617297534 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 9.
Adding to 50001100011 its reverse (11000110005), we get a palindrome (61001210016).
It can be divided in two parts, 5000 and 1100011, that added together give a palindrome (1105011).
The spelling of 50001100011 in words is "fifty billion, one million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •