Base | Representation |
---|---|
bin | 100100101111110110010… |
… | …0010100010100000010101 |
3 | 122212211100212100202111122 |
4 | 1021133230202202200111 |
5 | 1130222014043100010 |
6 | 14424105402413325 |
7 | 1030614314411363 |
oct | 111375442424025 |
9 | 18784325322448 |
10 | 5050555050005 |
11 | 1677a23726923 |
12 | 6969b8801245 |
13 | 2a835ab21c3a |
14 | 13663babc633 |
15 | 8b59aba5855 |
hex | 497ec8a2815 |
5050555050005 has 8 divisors (see below), whose sum is σ = 6070552957752. Its totient is φ = 4033852774848.
The previous prime is 5050555049927. The next prime is 5050555050007. The reversal of 5050555050005 is 5000505550505.
It can be written as a sum of positive squares in 4 ways, for example, as 265350674884 + 4785204375121 = 515122^2 + 2187511^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 5050555050005 - 232 = 5046260082709 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 (5050555050007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 823904774 + ... + 823910903.
It is an arithmetic number, because the mean of its divisors is an integer number (758819119719).
Almost surely, 25050555050005 is an apocalyptic number.
It is an amenable number.
5050555050005 is a deficient number, since it is larger than the sum of its proper divisors (1019997907747).
5050555050005 is a wasteful number, since it uses less digits than its factorization.
5050555050005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1647816295.
The product of its (nonzero) digits is 78125, while the sum is 35.
The spelling of 5050555050005 in words is "five trillion, fifty billion, five hundred fifty-five million, fifty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •