Base | Representation |
---|---|
bin | 1001010100001010… |
… | …10110111101001101 |
3 | 110220112021220001010 |
4 | 10222011112331031 |
5 | 40220224440432 |
6 | 2144125035433 |
7 | 234633633000 |
oct | 45205267515 |
9 | 13815256033 |
10 | 5001015117 |
11 | 2136a4074a |
12 | b769b5b79 |
13 | 619125957 |
14 | 356287537 |
15 | 1e40a73cc |
hex | 12a156f4d |
5001015117 has 32 divisors (see below), whose sum is σ = 7800140800. Its totient is φ = 2848895280.
The previous prime is 5001015091. The next prime is 5001015199. The reversal of 5001015117 is 7115101005.
It is a happy number.
It is not a de Polignac number, because 5001015117 - 219 = 5000490829 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5001015093 and 5001015102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5001015317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 333258 + ... + 347940.
It is an arithmetic number, because the mean of its divisors is an integer number (243754400).
Almost surely, 25001015117 is an apocalyptic number.
It is an amenable number.
5001015117 is a deficient number, since it is larger than the sum of its proper divisors (2799125683).
5001015117 is a wasteful number, since it uses less digits than its factorization.
5001015117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15038 (or 15024 counting only the distinct ones).
The product of its (nonzero) digits is 175, while the sum is 21.
The square root of 5001015117 is about 70717.8557155122. The cubic root of 5001015117 is about 1710.0916605564.
The spelling of 5001015117 in words is "five billion, one million, fifteen thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •