Base | Representation |
---|---|
bin | 100101001011101011000… |
… | …0011000110001110100111 |
3 | 200002112121002200002002001 |
4 | 1022113112003012032213 |
5 | 1132211402124013421 |
6 | 14511350455430131 |
7 | 1035131114632336 |
oct | 112272603061647 |
9 | 20075532602061 |
10 | 5110307251111 |
11 | 16a02a6243a07 |
12 | 6a64b3685347 |
13 | 2b0b9112a55a |
14 | 1394a96a9d1d |
15 | 8cde67ab691 |
hex | 4a5d60c63a7 |
5110307251111 has 32 divisors (see below), whose sum is σ = 5472439999488. Its totient is φ = 4764561768960.
The previous prime is 5110307251103. The next prime is 5110307251117. The reversal of 5110307251111 is 1111527030115.
It is a cyclic number.
It is not a de Polignac number, because 5110307251111 - 23 = 5110307251103 is a prime.
It is a super-2 number, since 2×51103072511112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5110307251111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5110307251117) 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, 315112275 + ... + 315128491.
It is an arithmetic number, because the mean of its divisors is an integer number (171013749984).
Almost surely, 25110307251111 is an apocalyptic number.
5110307251111 is a deficient number, since it is larger than the sum of its proper divisors (362132748377).
5110307251111 is a wasteful number, since it uses less digits than its factorization.
5110307251111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20151.
The product of its (nonzero) digits is 1050, while the sum is 28.
The spelling of 5110307251111 in words is "five trillion, one hundred ten billion, three hundred seven million, two hundred fifty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •