Base | Representation |
---|---|
bin | 100100100101000011000… |
… | …0111101110011101100000 |
3 | 122210121111111101002200112 |
4 | 1021022012013232131200 |
5 | 1124332014122033301 |
6 | 14405312125110452 |
7 | 1026133500101300 |
oct | 111120607563540 |
9 | 18717444332615 |
10 | 5027361908576 |
11 | 1669101809447 |
12 | 6924053b8428 |
13 | 2a6102a3a507 |
14 | 13547b6b5600 |
15 | 8ab8e9439bb |
hex | 492861ee760 |
5027361908576 has 72 divisors (see below), whose sum is σ = 11794375116216. Its totient is φ = 2102032826880.
The previous prime is 5027361908533. The next prime is 5027361908579. The reversal of 5027361908576 is 6758091637205.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5027361908579) 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 11 ways as a sum of consecutive naturals, for example, 39036026 + ... + 39164601.
It is an arithmetic number, because the mean of its divisors is an integer number (163810765503).
Almost surely, 25027361908576 is an apocalyptic number.
5027361908576 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
5027361908576 is an abundant number, since it is smaller than the sum of its proper divisors (6767013207640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5027361908576 is a wasteful number, since it uses less digits than its factorization.
5027361908576 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78200692 (or 78200677 counting only the distinct ones).
The product of its (nonzero) digits is 19051200, while the sum is 59.
The spelling of 5027361908576 in words is "five trillion, twenty-seven billion, three hundred sixty-one million, nine hundred eight thousand, five hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •