Base | Representation |
---|---|
bin | 1001010101010111… |
… | …10101001101101001 |
3 | 110221020021021121121 |
4 | 10222223311031221 |
5 | 40230320204041 |
6 | 2145125135241 |
7 | 235115436340 |
oct | 45253651551 |
9 | 13836237547 |
10 | 5011100521 |
11 | 21416a9a99 |
12 | b7a25a521 |
13 | 61b24734b |
14 | 357750b57 |
15 | 1e4dea7d1 |
hex | 12aaf5369 |
5011100521 has 8 divisors (see below), whose sum is σ = 5745629120. Its totient is φ = 4281236208.
The previous prime is 5011100509. The next prime is 5011100531. The reversal of 5011100521 is 1250011105.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5011100521 - 29 = 5011100009 is a prime.
It is a super-2 number, since 2×50111005212 = 50222256863132942882, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5011100495 and 5011100504.
It is not an unprimeable number, because it can be changed into a prime (5011100531) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1163766 + ... + 1168063.
It is an arithmetic number, because the mean of its divisors is an integer number (718203640).
Almost surely, 25011100521 is an apocalyptic number.
It is an amenable number.
5011100521 is a deficient number, since it is larger than the sum of its proper divisors (734528599).
5011100521 is a wasteful number, since it uses less digits than its factorization.
5011100521 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2332143.
The product of its (nonzero) digits is 50, while the sum is 16.
The square root of 5011100521 is about 70789.1271382830. The cubic root of 5011100521 is about 1711.2404529530.
Adding to 5011100521 its reverse (1250011105), we get a palindrome (6261111626).
The spelling of 5011100521 in words is "five billion, eleven million, one hundred thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •