Base | Representation |
---|---|
bin | 100100011101100000000… |
… | …1011111011101000101100 |
3 | 122202001200002111211211120 |
4 | 1020323000023323220230 |
5 | 1124100321443023320 |
6 | 14354032101020540 |
7 | 1025021060033205 |
oct | 110730013735054 |
9 | 18661602454746 |
10 | 5011156220460 |
11 | 1662246056075 |
12 | 68b2420b4750 |
13 | 2a471c487c50 |
14 | 1347812c05ac |
15 | 8a541d6d440 |
hex | 48ec02fba2c |
5011156220460 has 192 divisors, whose sum is σ = 15604377944064. Its totient is φ = 1193236531200.
The previous prime is 5011156220443. The next prime is 5011156220461. The reversal of 5011156220460 is 640226511105.
It is a super-2 number, since 2×50111562204602 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5011156220461) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 60916677 + ... + 60998883.
It is an arithmetic number, because the mean of its divisors is an integer number (81272801792).
Almost surely, 25011156220460 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 5011156220460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7802188972032).
5011156220460 is an abundant number, since it is smaller than the sum of its proper divisors (10593221723604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5011156220460 is a wasteful number, since it uses less digits than its factorization.
5011156220460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84784 (or 84782 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 33.
The spelling of 5011156220460 in words is "five trillion, eleven billion, one hundred fifty-six million, two hundred twenty thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •