Base | Representation |
---|---|
bin | 1001010100101001… |
… | …00110100001000011 |
3 | 110220210210220101012 |
4 | 10222110212201003 |
5 | 40222240323021 |
6 | 2144350431135 |
7 | 235012614560 |
oct | 45224464103 |
9 | 13823726335 |
10 | 5005011011 |
11 | 213921a940 |
12 | b782024ab |
13 | 619bc46a0 |
14 | 356a07867 |
15 | 1e45e635b |
hex | 12a526843 |
5005011011 has 16 divisors (see below), whose sum is σ = 6720016128. Its totient is φ = 3600007200.
The previous prime is 5005011001. The next prime is 5005011073. The reversal of 5005011011 is 1101105005.
5005011011 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 5005011011 - 222 = 5000816707 is a prime.
5005011011 is a modest number, since divided by 11011 gives 5005 as remainder.
It is not an unprimeable number, because it can be changed into a prime (5005011001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2499005 + ... + 2501006.
It is an arithmetic number, because the mean of its divisors is an integer number (420001008).
Almost surely, 25005011011 is an apocalyptic number.
5005011011 is a deficient number, since it is larger than the sum of its proper divisors (1715005117).
5005011011 is a wasteful number, since it uses less digits than its factorization.
5005011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5000042.
The product of its (nonzero) digits is 25, while the sum is 14.
The square root of 5005011011 is about 70746.1024438803. The cubic root of 5005011011 is about 1710.5470031664.
Adding to 5005011011 its reverse (1101105005), we get a palindrome (6106116016).
The spelling of 5005011011 in words is "five billion, five million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •