Base | Representation |
---|---|
bin | 1001011011100011… |
… | …01001011001110001 |
3 | 111001211211211212020 |
4 | 10231301221121301 |
5 | 40332104103112 |
6 | 2154220422053 |
7 | 236315264403 |
oct | 45561513161 |
9 | 14054754766 |
10 | 5062956657 |
11 | 21689a8300 |
12 | b936a7929 |
13 | 628c02555 |
14 | 3605acb73 |
15 | 1e974048c |
hex | 12dc69671 |
5062956657 has 48 divisors (see below), whose sum is σ = 7887559680. Its totient is φ = 2878333920.
The previous prime is 5062956631. The next prime is 5062956659. The reversal of 5062956657 is 7566592605.
It is not a de Polignac number, because 5062956657 - 220 = 5061908081 is a prime.
It is a super-2 number, since 2×50629566572 = 51267060221321231298, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5062956659) 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 47 ways as a sum of consecutive naturals, for example, 706828 + ... + 713954.
It is an arithmetic number, because the mean of its divisors is an integer number (164324160).
Almost surely, 25062956657 is an apocalyptic number.
5062956657 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
It is an amenable number.
5062956657 is a deficient number, since it is larger than the sum of its proper divisors (2824603023).
5062956657 is a wasteful number, since it uses less digits than its factorization.
5062956657 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7274 (or 7263 counting only the distinct ones).
The product of its (nonzero) digits is 3402000, while the sum is 51.
The square root of 5062956657 is about 71154.4563397121. The cubic root of 5062956657 is about 1717.1229910947.
The spelling of 5062956657 in words is "five billion, sixty-two million, nine hundred fifty-six thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •