Base | Representation |
---|---|
bin | 1010010010000100… |
… | …00100000101111011 |
3 | 112020201022111200210 |
4 | 11021002010011323 |
5 | 42301140320430 |
6 | 2311434002203 |
7 | 253540211040 |
oct | 51102040573 |
9 | 15221274623 |
10 | 5520245115 |
11 | 2383041950 |
12 | 10a0876363 |
13 | 69c881838 |
14 | 3a52071c7 |
15 | 22496d2b0 |
hex | 14908417b |
5520245115 has 32 divisors (see below), whose sum is σ = 11011815936. Its totient is φ = 2294127360.
The previous prime is 5520245077. The next prime is 5520245131. The reversal of 5520245115 is 5115420255.
5520245115 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5520245115 - 214 = 5520228731 is a prime.
It is a super-2 number, since 2×55202451152 = 60946212259362726450, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2388562 + ... + 2390871.
It is an arithmetic number, because the mean of its divisors is an integer number (344119248).
Almost surely, 25520245115 is an apocalyptic number.
5520245115 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5520245115 is a deficient number, since it is larger than the sum of its proper divisors (5491570821).
5520245115 is a wasteful number, since it uses less digits than its factorization.
5520245115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4779459.
The product of its (nonzero) digits is 10000, while the sum is 30.
The square root of 5520245115 is about 74298.3520342141. The cubic root of 5520245115 is about 1767.3373431806.
The spelling of 5520245115 in words is "five billion, five hundred twenty million, two hundred forty-five thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.235 sec. • engine limits •