Base | Representation |
---|---|
bin | 1001011010101110… |
… | …01000001110111100 |
3 | 111001100202200001101 |
4 | 10231113020032330 |
5 | 40323314130202 |
6 | 2153411422444 |
7 | 236202222340 |
oct | 45527101674 |
9 | 14040680041 |
10 | 5056005052 |
11 | 2164a8a47a |
12 | b912b4a24 |
13 | 62763a387 |
14 | 35d6bd620 |
15 | 1e8d1a887 |
hex | 12d5c83bc |
5056005052 has 12 divisors (see below), whose sum is σ = 10112010160. Its totient is φ = 2166859296.
The previous prime is 5056005041. The next prime is 5056005067. The reversal of 5056005052 is 2505006505.
5056005052 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 180571609 = 5056005052 / (5 + 0 + 5 + 6 + 0 + 0 + 5 + 0 + 5 + 2).
It is a self number, because there is not a number n which added to its sum of digits gives 5056005052.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 90285777 + ... + 90285832.
Almost surely, 25056005052 is an apocalyptic number.
It is an amenable number.
5056005052 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5056005052 is a wasteful number, since it uses less digits than its factorization.
5056005052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180571620 (or 180571618 counting only the distinct ones).
The product of its (nonzero) digits is 7500, while the sum is 28.
The square root of 5056005052 is about 71105.5908631663. The cubic root of 5056005052 is about 1716.3367424697.
The spelling of 5056005052 in words is "five billion, fifty-six million, five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •