Base | Representation |
---|---|
bin | 1010010010000011… |
… | …00100000111010000 |
3 | 112020201001212000102 |
4 | 11021001210013100 |
5 | 42301122123003 |
6 | 2311431111532 |
7 | 253536124124 |
oct | 51101440720 |
9 | 15221055012 |
10 | 5520114128 |
11 | 2382a624a1 |
12 | 10a08125a8 |
13 | 69c837029 |
14 | 3a51b1584 |
15 | 224944588 |
hex | 1490641d0 |
5520114128 has 20 divisors (see below), whose sum is σ = 10696377888. Its totient is φ = 2759758560.
The previous prime is 5520114113. The next prime is 5520114143. The reversal of 5520114128 is 8214110255.
It is an interprime number because it is at equal distance from previous prime (5520114113) and next prime (5520114143).
It is a super-2 number, since 2×55201141282 = 60943319972290400768, which contains 22 as substring.
It is a hoax number, since the sum of its digits (29) coincides with the sum of the digits of its distinct prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 5520114128.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 260243 + ... + 280653.
Almost surely, 25520114128 is an apocalyptic number.
It is an amenable number.
5520114128 is a deficient number, since it is larger than the sum of its proper divisors (5176263760).
5520114128 is a wasteful number, since it uses less digits than its factorization.
5520114128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37322 (or 37316 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 29.
The square root of 5520114128 is about 74297.4705356784. The cubic root of 5520114128 is about 1767.3233643298.
The spelling of 5520114128 in words is "five billion, five hundred twenty million, one hundred fourteen thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •