Base | Representation |
---|---|
bin | 100101001001001100111… |
… | …0001110000011011011011 |
3 | 200002000220022012221011021 |
4 | 1022102121301300123123 |
5 | 1132120020240330430 |
6 | 14505112150343311 |
7 | 1034552454300052 |
oct | 112223161603333 |
9 | 20060808187137 |
10 | 5105001105115 |
11 | 169902304498a |
12 | 6a547265ab37 |
13 | 2b0526a2b5b2 |
14 | 139124ab5399 |
15 | 8cbd5a3007a |
hex | 4a499c706db |
5105001105115 has 32 divisors (see below), whose sum is σ = 6254038771200. Its totient is φ = 3999395119104.
The previous prime is 5105001105049. The next prime is 5105001105173. The reversal of 5105001105115 is 5115011005015.
It is a cyclic number.
It is not a de Polignac number, because 5105001105115 - 221 = 5104999007963 is a prime.
It is a super-3 number, since 3×51050011051153 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 5105001105115.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 79099099 + ... + 79163611.
It is an arithmetic number, because the mean of its divisors is an integer number (195438711600).
Almost surely, 25105001105115 is an apocalyptic number.
5105001105115 is a deficient number, since it is larger than the sum of its proper divisors (1149037666085).
5105001105115 is a wasteful number, since it uses less digits than its factorization.
5105001105115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65971.
The product of its (nonzero) digits is 625, while the sum is 25.
The spelling of 5105001105115 in words is "five trillion, one hundred five billion, one million, one hundred five thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •