Base | Representation |
---|---|
bin | 100101001011110011110… |
… | …0011110111101110000110 |
3 | 200002120100120111212101122 |
4 | 1022113213203313232012 |
5 | 1132213002332230420 |
6 | 14511435552553542 |
7 | 1035141313134635 |
oct | 112274743675606 |
9 | 20076316455348 |
10 | 5110601055110 |
11 | 16a0437076231 |
12 | 6a6575b528b2 |
13 | 2b0c09c69085 |
14 | 1394d670951c |
15 | 8ce12494725 |
hex | 4a5e78f7b86 |
5110601055110 has 32 divisors (see below), whose sum is σ = 9518030180640. Its totient is φ = 1973388782848.
The previous prime is 5110601055097. The next prime is 5110601055113. The reversal of 5110601055110 is 115501060115.
It is a super-2 number, since 2×51106010551102 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5110601055110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5110601055113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16967 + ... + 3197106.
It is an arithmetic number, because the mean of its divisors is an integer number (297438443145).
Almost surely, 25110601055110 is an apocalyptic number.
5110601055110 is a deficient number, since it is larger than the sum of its proper divisors (4407429125530).
5110601055110 is a wasteful number, since it uses less digits than its factorization.
5110601055110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3219592.
The product of its (nonzero) digits is 750, while the sum is 26.
The spelling of 5110601055110 in words is "five trillion, one hundred ten billion, six hundred one million, fifty-five thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •