Base | Representation |
---|---|
bin | 100100011010101011111… |
… | …0011101010011001000011 |
3 | 122201111001201121002202022 |
4 | 1020311113303222121003 |
5 | 1124000431133414421 |
6 | 14351152114512055 |
7 | 1024415202363053 |
oct | 110652763523103 |
9 | 18644051532668 |
10 | 5005110060611 |
11 | 165a723167751 |
12 | 68a03529562b |
13 | 2a3c9797997b |
14 | 13436a2d7563 |
15 | 8a2db1687ab |
hex | 48d57cea643 |
5005110060611 has 8 divisors (see below), whose sum is σ = 5082443991744. Its totient is φ = 4927853505960.
The previous prime is 5005110060593. The next prime is 5005110060623. The reversal of 5005110060611 is 1160600115005.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5005110060611 - 26 = 5005110060547 is a prime.
It is a super-2 number, since 2×50051100606112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5005110060311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19213745 + ... + 19472498.
It is an arithmetic number, because the mean of its divisors is an integer number (635305498968).
Almost surely, 25005110060611 is an apocalyptic number.
5005110060611 is a deficient number, since it is larger than the sum of its proper divisors (77333931133).
5005110060611 is a wasteful number, since it uses less digits than its factorization.
5005110060611 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38688241.
The product of its (nonzero) digits is 900, while the sum is 26.
Adding to 5005110060611 its reverse (1160600115005), we get a palindrome (6165710175616).
It can be divided in two parts, 5005 and 110060611, that multiplied together give a palindrome (550853358055).
The spelling of 5005110060611 in words is "five trillion, five billion, one hundred ten million, sixty thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •