Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …10110010110001111011001 |
3 | 20120001000011200102121120122 |
4 | 23113212221112112033121 |
5 | 23023202114202004010 |
6 | 254201534343403025 |
7 | 13350264243202121 |
oct | 1327465126261731 |
9 | 216030150377518 |
10 | 50000555500505 |
11 | 14a28131082915 |
12 | 5736538a53475 |
13 | 21b905583acbc |
14 | c4c07b2c9c81 |
15 | 5ba9687dc855 |
hex | 2d79a95963d9 |
50000555500505 has 8 divisors (see below), whose sum is σ = 60147367499400. Its totient is φ = 39902643801216.
The previous prime is 50000555500501. The next prime is 50000555500531. The reversal of 50000555500505 is 50500555500005.
It can be written as a sum of positive squares in 4 ways, for example, as 10228310537929 + 39772244962576 = 3198173^2 + 6306524^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 50000555500505 - 22 = 50000555500501 is a prime.
It is a super-2 number, since 2×500005555005052 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (50000555500501) 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, 12225072650 + ... + 12225076739.
It is an arithmetic number, because the mean of its divisors is an integer number (7518420937425).
Almost surely, 250000555500505 is an apocalyptic number.
It is an amenable number.
50000555500505 is a deficient number, since it is larger than the sum of its proper divisors (10146811998895).
50000555500505 is a wasteful number, since it uses less digits than its factorization.
50000555500505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24450149803.
The product of its (nonzero) digits is 78125, while the sum is 35.
The spelling of 50000555500505 in words is "fifty trillion, five hundred fifty-five million, five hundred thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •