Base | Representation |
---|---|
bin | 100100011011001001100… |
… | …0111011100001100110001 |
3 | 122201120122001221101200221 |
4 | 1020312103013130030301 |
5 | 1124010000401213410 |
6 | 14351434542013041 |
7 | 1024451644156543 |
oct | 110662307341461 |
9 | 18646561841627 |
10 | 5006105101105 |
11 | 1660093903369 |
12 | 68a272577181 |
13 | 2a40c5b6b624 |
14 | 134422513693 |
15 | 8a3486ba4da |
hex | 48d931dc331 |
5006105101105 has 4 divisors (see below), whose sum is σ = 6007326121332. Its totient is φ = 4004884080880.
The previous prime is 5006105101073. The next prime is 5006105101133. The reversal of 5006105101105 is 5011015016005.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 723717712656 + 4282387388449 = 850716^2 + 2069393^2 .
It is not a de Polignac number, because 5006105101105 - 25 = 5006105101073 is a prime.
It is a super-2 number, since 2×50061051011052 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5006105101105.
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, 500610510106 + ... + 500610510115.
It is an arithmetic number, because the mean of its divisors is an integer number (1501831530333).
Almost surely, 25006105101105 is an apocalyptic number.
It is an amenable number.
5006105101105 is a deficient number, since it is larger than the sum of its proper divisors (1001221020227).
5006105101105 is a wasteful number, since it uses less digits than its factorization.
5006105101105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1001221020226.
The product of its (nonzero) digits is 750, while the sum is 25.
The spelling of 5006105101105 in words is "five trillion, six billion, one hundred five million, one hundred one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •