Base | Representation |
---|---|
bin | 10110111101111001110100… |
… | …11010101011001110101101 |
3 | 20121211021112011112120201222 |
4 | 23132330322122223032231 |
5 | 23104440231112130010 |
6 | 255225523455313125 |
7 | 13431621246004310 |
oct | 1336747232531655 |
9 | 217737464476658 |
10 | 50505500505005 |
11 | 151022983a5397 |
12 | 57b8379b1b7a5 |
13 | 2224857300530 |
14 | c6869d176977 |
15 | 5c8b6d612355 |
hex | 2def3a6ab3ad |
50505500505005 has 64 divisors (see below), whose sum is σ = 74921704704000. Its totient is φ = 31827391948800.
The previous prime is 50505500505001. The next prime is 50505500505007. The reversal of 50505500505005 is 50050500550505.
It is not a de Polignac number, because 50505500505005 - 22 = 50505500505001 is a prime.
It is a super-2 number, since 2×505055005050052 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50505500505001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 505505555 + ... + 505605455.
It is an arithmetic number, because the mean of its divisors is an integer number (1170651636000).
Almost surely, 250505500505005 is an apocalyptic number.
It is an amenable number.
50505500505005 is a deficient number, since it is larger than the sum of its proper divisors (24416204198995).
50505500505005 is a wasteful number, since it uses less digits than its factorization.
50505500505005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104814.
The product of its (nonzero) digits is 78125, while the sum is 35.
The spelling of 50505500505005 in words is "fifty trillion, five hundred five billion, five hundred million, five hundred five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •