Base | Representation |
---|---|
bin | 100101001011110010110… |
… | …0000101101000011011000 |
3 | 200002120021011210221122111 |
4 | 1022113211200231003120 |
5 | 1132212420031424202 |
6 | 14511432324002104 |
7 | 1035140414645260 |
oct | 112274540550330 |
9 | 20076234727574 |
10 | 5110566670552 |
11 | 16a0419720642 |
12 | 6a6566530334 |
13 | 2b0c02aba495 |
14 | 1394d1d187a0 |
15 | 8ce0e4516d7 |
hex | 4a5e582d0d8 |
5110566670552 has 32 divisors (see below), whose sum is σ = 11595403372320. Its totient is φ = 2061405043200.
The previous prime is 5110566670537. The next prime is 5110566670577. The reversal of 5110566670552 is 2550766650115.
It is a happy number.
It is a super-2 number, since 2×51105666705522 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5110566670496 and 5110566670505.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2684120199 + ... + 2684122102.
It is an arithmetic number, because the mean of its divisors is an integer number (362356355385).
Almost surely, 25110566670552 is an apocalyptic number.
It is an amenable number.
5110566670552 is an abundant number, since it is smaller than the sum of its proper divisors (6484836701768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5110566670552 is a wasteful number, since it uses less digits than its factorization.
5110566670552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5368242331 (or 5368242327 counting only the distinct ones).
The product of its (nonzero) digits is 1890000, while the sum is 49.
The spelling of 5110566670552 in words is "five trillion, one hundred ten billion, five hundred sixty-six million, six hundred seventy thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •