Base | Representation |
---|---|
bin | 101111000010010111… |
… | …011001110000111001 |
3 | 11211100211010000201011 |
4 | 233002113121300321 |
5 | 1311413410230001 |
6 | 35111341153521 |
7 | 3435401064016 |
oct | 570227316071 |
9 | 154324100634 |
10 | 50505555001 |
11 | 1a468084000 |
12 | 995625b8a1 |
13 | 49bb71b3b5 |
14 | 263193070d |
15 | 14a8e58d51 |
hex | bc25d9c39 |
50505555001 has 8 divisors (see below), whose sum is σ = 55552317408. Its totient is φ = 45914139700.
The previous prime is 50505554971. The next prime is 50505555007. The reversal of 50505555001 is 10055550505.
It is not a de Polignac number, because 50505555001 - 211 = 50505552953 is a prime.
It is a super-2 number, since 2×505055550012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50505555007) 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, 18971455 + ... + 18974116.
It is an arithmetic number, because the mean of its divisors is an integer number (6944039676).
Almost surely, 250505555001 is an apocalyptic number.
It is an amenable number.
50505555001 is a deficient number, since it is larger than the sum of its proper divisors (5046762407).
50505555001 is an equidigital number, since it uses as much as digits as its factorization.
50505555001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37945604 (or 37945582 counting only the distinct ones).
The product of its (nonzero) digits is 15625, while the sum is 31.
It can be divided in two parts, 50505 and 555001, that added together give a palindrome (605506).
The spelling of 50505555001 in words is "fifty billion, five hundred five million, five hundred fifty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •