Base | Representation |
---|---|
bin | 10110110000110010110010… |
… | …11110110001001100001011 |
3 | 20120020012211111122101022021 |
4 | 23120121121132301030023 |
5 | 23030100220311334421 |
6 | 254242550024105311 |
7 | 13354233542535625 |
oct | 1330313136611413 |
9 | 216205744571267 |
10 | 50055050105611 |
11 | 14a49255941241 |
12 | 5745007005237 |
13 | 21c122b815a75 |
14 | c5096a91dc15 |
15 | 5bc0a7a57341 |
hex | 2d86597b130b |
50055050105611 has 8 divisors (see below), whose sum is σ = 50114229824624. Its totient is φ = 49995882668160.
The previous prime is 50055050105537. The next prime is 50055050105633. The reversal of 50055050105611 is 11650105055005.
50055050105611 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 50055050105611 - 27 = 50055050105483 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50055050105911) 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, 5098516 + ... + 11229646.
It is an arithmetic number, because the mean of its divisors is an integer number (6264278728078).
Almost surely, 250055050105611 is an apocalyptic number.
50055050105611 is a deficient number, since it is larger than the sum of its proper divisors (59179719013).
50055050105611 is an equidigital number, since it uses as much as digits as its factorization.
50055050105611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6140781.
The product of its (nonzero) digits is 18750, while the sum is 34.
The spelling of 50055050105611 in words is "fifty trillion, fifty-five billion, fifty million, one hundred five thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •