Base | Representation |
---|---|
bin | 100100011011001000001… |
… | …1101101110010111110101 |
3 | 122201120111222020001211112 |
4 | 1020312100131232113311 |
5 | 1124004403004023221 |
6 | 14351430312244405 |
7 | 1024450564051136 |
oct | 110662035562765 |
9 | 18646458201745 |
10 | 5006060611061 |
11 | 1660070786334 |
12 | 68a25b6a0705 |
13 | 2a40b9892163 |
14 | 13441a651c8d |
15 | 8a34482d15b |
hex | 48d9076e5f5 |
5006060611061 has 8 divisors (see below), whose sum is σ = 5007823299864. Its totient is φ = 5004298091520.
The previous prime is 5006060611037. The next prime is 5006060611067. The reversal of 5006060611061 is 1601160606005.
It can be written as a sum of positive squares in 4 ways, for example, as 3697967460100 + 1308093150961 = 1923010^2 + 1143719^2 .
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 5006060611061 - 230 = 5004986869237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5006060611067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 93802361 + ... + 93855713.
It is an arithmetic number, because the mean of its divisors is an integer number (625977912483).
Almost surely, 25006060611061 is an apocalyptic number.
It is an amenable number.
5006060611061 is a deficient number, since it is larger than the sum of its proper divisors (1762688803).
5006060611061 is a wasteful number, since it uses less digits than its factorization.
5006060611061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84631.
The product of its (nonzero) digits is 6480, while the sum is 32.
The spelling of 5006060611061 in words is "five trillion, six billion, sixty million, six hundred eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •