Base | Representation |
---|---|
bin | 100100011010101000111… |
… | …0110011000100010001001 |
3 | 122201110210202112010010002 |
4 | 1020311101312120202021 |
5 | 1124000230042014401 |
6 | 14351134144332345 |
7 | 1024412546666444 |
oct | 110652166304211 |
9 | 18643722463102 |
10 | 5005010110601 |
11 | 165a6817aa836 |
12 | 68a0079140b5 |
13 | 2a3c80052b57 |
14 | 13435ad1a65b |
15 | 8a2d24c3a6b |
hex | 48d51d98889 |
5005010110601 has 8 divisors (see below), whose sum is σ = 5079937788744. Its totient is φ = 4930254483840.
The previous prime is 5005010110553. The next prime is 5005010110621. The reversal of 5005010110601 is 1060110105005.
It can be written as a sum of positive squares in 4 ways, for example, as 15706104976 + 4989304005625 = 125324^2 + 2233675^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5005010110601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5005010110621) 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, 42954230 + ... + 43070591.
It is an arithmetic number, because the mean of its divisors is an integer number (634992223593).
Almost surely, 25005010110601 is an apocalyptic number.
It is an amenable number.
5005010110601 is a deficient number, since it is larger than the sum of its proper divisors (74927678143).
5005010110601 is an equidigital number, since it uses as much as digits as its factorization.
5005010110601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86025691.
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 5005010110601 its reverse (1060110105005), we get a palindrome (6065120215606).
The spelling of 5005010110601 in words is "five trillion, five billion, ten million, one hundred ten thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •