Base | Representation |
---|---|
bin | 1001100011011110001111… |
… | …0000011100011011011110 |
3 | 1101012021021122020121100220 |
4 | 2120313203300130123132 |
5 | 2334103233114303420 |
6 | 34201534322102210 |
7 | 2132651044051644 |
oct | 230674360343336 |
9 | 41167248217326 |
10 | 10505016166110 |
11 | 3390174840344 |
12 | 1217b387aa966 |
13 | 5b28075a520b |
14 | 284634621194 |
15 | 1333d6122840 |
hex | 98de3c1c6de |
10505016166110 has 64 divisors (see below), whose sum is σ = 26542526757120. Its totient is φ = 2653544966400.
The previous prime is 10505016166109. The next prime is 10505016166111. The reversal of 10505016166110 is 1166161050501.
It is an interprime number because it is at equal distance from previous prime (10505016166109) and next prime (10505016166111).
It is a super-2 number, since 2×105050161661102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10505016166111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3063210 + ... + 5513010.
It is an arithmetic number, because the mean of its divisors is an integer number (414726980580).
Almost surely, 210505016166110 is an apocalyptic number.
10505016166110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10505016166110 is an abundant number, since it is smaller than the sum of its proper divisors (16037510591010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10505016166110 is a wasteful number, since it uses less digits than its factorization.
10505016166110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2457353.
The product of its (nonzero) digits is 5400, while the sum is 33.
The spelling of 10505016166110 in words is "ten trillion, five hundred five billion, sixteen million, one hundred sixty-six thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •