Base | Representation |
---|---|
bin | 1001010101010111… |
… | …10111100001110101 |
3 | 110221020021202121212 |
4 | 10222223313201311 |
5 | 40230321010010 |
6 | 2145125251205 |
7 | 235115506106 |
oct | 45253674165 |
9 | 13836252555 |
10 | 5011110005 |
11 | 2141706130 |
12 | b7a263b05 |
13 | 61b24b765 |
14 | 3577543ad |
15 | 1e4ded505 |
hex | 12aaf7875 |
5011110005 has 8 divisors (see below), whose sum is σ = 6559998624. Its totient is φ = 3644443600.
The previous prime is 5011109969. The next prime is 5011110011. The reversal of 5011110005 is 5000111105.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5011110005 - 220 = 5010061429 is a prime.
It is a super-2 number, since 2×50111100052 = 50222446964422200050, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 45555491 + ... + 45555600.
It is an arithmetic number, because the mean of its divisors is an integer number (819999828).
Almost surely, 25011110005 is an apocalyptic number.
5011110005 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5011110005 is a deficient number, since it is larger than the sum of its proper divisors (1548888619).
5011110005 is a wasteful number, since it uses less digits than its factorization.
5011110005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91111107.
The product of its (nonzero) digits is 25, while the sum is 14.
The square root of 5011110005 is about 70789.1941259399. The cubic root of 5011110005 is about 1711.2415325159.
The spelling of 5011110005 in words is "five billion, eleven million, one hundred ten thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •