Base | Representation |
---|---|
bin | 100101010111111100011… |
… | …1010111100010101100000 |
3 | 200012001121211000010021220 |
4 | 1022233320322330111200 |
5 | 1133124341000313101 |
6 | 14531430000015040 |
7 | 1040053163420205 |
oct | 112577072742540 |
9 | 20161554003256 |
10 | 5136662119776 |
11 | 170049a943900 |
12 | 6ab629901480 |
13 | 2b35012701b5 |
14 | 13a889977cac |
15 | 8d93a3ab636 |
hex | 4abf8ebc560 |
5136662119776 has 144 divisors (see below), whose sum is σ = 14886266536512. Its totient is φ = 1549706371840.
The previous prime is 5136662119733. The next prime is 5136662119781. The reversal of 5136662119776 is 6779112666315.
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 23 ways as a sum of consecutive naturals, for example, 1662811 + ... + 3610853.
It is an arithmetic number, because the mean of its divisors is an integer number (103376850948).
Almost surely, 25136662119776 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5136662119776, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7443133268256).
5136662119776 is an abundant number, since it is smaller than the sum of its proper divisors (9749604416736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5136662119776 is a wasteful number, since it uses less digits than its factorization.
5136662119776 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1948305 (or 1948286 counting only the distinct ones).
The product of its digits is 17146080, while the sum is 60.
The spelling of 5136662119776 in words is "five trillion, one hundred thirty-six billion, six hundred sixty-two million, one hundred nineteen thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •