Base | Representation |
---|---|
bin | 100100011010110001101… |
… | …1101001101101101000100 |
3 | 122201111120100100120122222 |
4 | 1020311203131031231010 |
5 | 1124001331202040112 |
6 | 14351223335511512 |
7 | 1024423064534426 |
oct | 110654335155504 |
9 | 18644510316588 |
10 | 5005305502532 |
11 | 165a8135170a5 |
12 | 68a08a828598 |
13 | 2a3cc92c938a |
14 | 134388250816 |
15 | 8a2ed3c2372 |
hex | 48d6374db44 |
5005305502532 has 12 divisors (see below), whose sum is σ = 8945652387840. Its totient is φ = 2449404820296.
The previous prime is 5005305502517. The next prime is 5005305502553. The reversal of 5005305502532 is 2352055035005.
It is a super-2 number, since 2×50053055025322 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5005305502492 and 5005305502501.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13311982532 + ... + 13311982907.
It is an arithmetic number, because the mean of its divisors is an integer number (745471032320).
Almost surely, 25005305502532 is an apocalyptic number.
It is an amenable number.
5005305502532 is a deficient number, since it is larger than the sum of its proper divisors (3940346885308).
5005305502532 is a wasteful number, since it uses less digits than its factorization.
5005305502532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26623965490 (or 26623965488 counting only the distinct ones).
The product of its (nonzero) digits is 112500, while the sum is 35.
The spelling of 5005305502532 in words is "five trillion, five billion, three hundred five million, five hundred two thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •