Base | Representation |
---|---|
bin | 1001010100010010… |
… | …01011011011110101 |
3 | 110220121011202200102 |
4 | 10222021023123311 |
5 | 40221004012001 |
6 | 2144202323445 |
7 | 234645303326 |
oct | 45211133365 |
9 | 13817152612 |
10 | 5002016501 |
11 | 2137565039 |
12 | b771b9585 |
13 | 6193b66a1 |
14 | 35646844d |
15 | 1e4203e6b |
hex | 12a24b6f5 |
5002016501 has 16 divisors (see below), whose sum is σ = 5324587008. Its totient is φ = 4691530800.
The previous prime is 5002016491. The next prime is 5002016561. The reversal of 5002016501 is 1056102005.
5002016501 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 5002016501 - 210 = 5002015477 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5002016561) 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 15 ways as a sum of consecutive naturals, for example, 133406 + ... + 166736.
It is an arithmetic number, because the mean of its divisors is an integer number (332786688).
Almost surely, 25002016501 is an apocalyptic number.
It is an amenable number.
5002016501 is a deficient number, since it is larger than the sum of its proper divisors (322570507).
5002016501 is a wasteful number, since it uses less digits than its factorization.
5002016501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33512.
The product of its (nonzero) digits is 300, while the sum is 20.
The square root of 5002016501 is about 70724.9354966125. The cubic root of 5002016501 is about 1710.2057936608.
Adding to 5002016501 its reverse (1056102005), we get a palindrome (6058118506).
The spelling of 5002016501 in words is "five billion, two million, sixteen thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •