Base | Representation |
---|---|
bin | 1001011011011111… |
… | …11001111010101001 |
3 | 111001210222122110100 |
4 | 10231233321322221 |
5 | 40332000000014 |
6 | 2154202540013 |
7 | 236311353150 |
oct | 45557717251 |
9 | 14053878410 |
10 | 5062500009 |
11 | 2168716206 |
12 | b93507609 |
13 | 628aa2748 |
14 | 3604d0597 |
15 | 1e96a0009 |
hex | 12dbf9ea9 |
5062500009 has 24 divisors (see below), whose sum is σ = 8360897792. Its totient is φ = 2891557440.
The previous prime is 5062499999. The next prime is 5062500013. The reversal of 5062500009 is 9000052605.
It is not a de Polignac number, because 5062500009 - 24 = 5062499993 is a prime.
It is a super-2 number, since 2×50625000092 = 51257812682250000162, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5062500019) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 133269 + ... + 166989.
Almost surely, 25062500009 is an apocalyptic number.
It is an amenable number.
5062500009 is a deficient number, since it is larger than the sum of its proper divisors (3298397783).
5062500009 is a wasteful number, since it uses less digits than its factorization.
5062500009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36117 (or 36114 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
The square root of 5062500009 is about 71151.2474170341. The cubic root of 5062500009 is about 1717.0713648475.
It can be divided in two parts, 506250000 and 9, that multiplied together give a square (4556250000 = 675002).
The spelling of 5062500009 in words is "five billion, sixty-two million, five hundred thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •