Base | Representation |
---|---|
bin | 100101001011100100110… |
… | …1100111001100101011101 |
3 | 200002112001122212222210210 |
4 | 1022113021230321211131 |
5 | 1132210441111334230 |
6 | 14511314135523033 |
7 | 1035123021134430 |
oct | 112271154714535 |
9 | 20075048788723 |
10 | 5110100105565 |
11 | 16a01aa320444 |
12 | 6a6456229479 |
13 | 2b0b5a240a20 |
14 | 139489d87817 |
15 | 8cdd34deeb0 |
hex | 4a5c9b3995d |
5110100105565 has 128 divisors (see below), whose sum is σ = 10620565401600. Its totient is φ = 2037463787520.
The previous prime is 5110100105521. The next prime is 5110100105599. The reversal of 5110100105565 is 5655010010115.
It is not a de Polignac number, because 5110100105565 - 210 = 5110100104541 is a prime.
It is a super-2 number, since 2×51101001055652 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 9569425 + ... + 10089305.
It is an arithmetic number, because the mean of its divisors is an integer number (82973167200).
Almost surely, 25110100105565 is an apocalyptic number.
It is an amenable number.
5110100105565 is an abundant number, since it is smaller than the sum of its proper divisors (5510465296035).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5110100105565 is a wasteful number, since it uses less digits than its factorization.
5110100105565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 520307.
The product of its (nonzero) digits is 3750, while the sum is 30.
The spelling of 5110100105565 in words is "five trillion, one hundred ten billion, one hundred million, one hundred five thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •