Base | Representation |
---|---|
bin | 100100100101001100101… |
… | …1110000011001010010101 |
3 | 122210122100010012110022201 |
4 | 1021022121132003022111 |
5 | 1124333200222341022 |
6 | 14405404242524501 |
7 | 1026144521235454 |
oct | 111123136031225 |
9 | 18718303173281 |
10 | 5027686527637 |
11 | 1669258a78564 |
12 | 692496066731 |
13 | 2a6155077cb7 |
14 | 1354ac856b9b |
15 | 8abad1b7127 |
hex | 49299783295 |
5027686527637 has 32 divisors (see below), whose sum is σ = 5517196162560. Its totient is φ = 4566282336000.
The previous prime is 5027686527607. The next prime is 5027686527659. The reversal of 5027686527637 is 7367256867205.
It is a happy number.
5027686527637 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 a de Polignac number, because none of the positive numbers 2k-5027686527637 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 (5027686527607) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 334480312 + ... + 334495342.
It is an arithmetic number, because the mean of its divisors is an integer number (172412380080).
Almost surely, 25027686527637 is an apocalyptic number.
It is an amenable number.
5027686527637 is a deficient number, since it is larger than the sum of its proper divisors (489509634923).
5027686527637 is a wasteful number, since it uses less digits than its factorization.
5027686527637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23365.
The product of its (nonzero) digits is 177811200, while the sum is 64.
The spelling of 5027686527637 in words is "five trillion, twenty-seven billion, six hundred eighty-six million, five hundred twenty-seven thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •