Base | Representation |
---|---|
bin | 101110110000001101… |
… | …110111110110011111 |
3 | 11210120121011102120111 |
4 | 232300031313312133 |
5 | 1310302433120121 |
6 | 35021223030451 |
7 | 3425013012442 |
oct | 566015676637 |
9 | 153517142514 |
10 | 50201066911 |
11 | 1a321214656 |
12 | 989029b427 |
13 | 497060b828 |
14 | 260330d659 |
15 | 148c3602e1 |
hex | bb0377d9f |
50201066911 has 2 divisors, whose sum is σ = 50201066912. Its totient is φ = 50201066910.
The previous prime is 50201066887. The next prime is 50201066933. The reversal of 50201066911 is 11966010205.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 50201066911 - 221 = 50198969759 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50201066611) 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 as a sum of consecutive naturals, namely, 25100533455 + 25100533456.
It is an arithmetic number, because the mean of its divisors is an integer number (25100533456).
Almost surely, 250201066911 is an apocalyptic number.
50201066911 is a deficient number, since it is larger than the sum of its proper divisors (1).
50201066911 is an equidigital number, since it uses as much as digits as its factorization.
50201066911 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 31.
The spelling of 50201066911 in words is "fifty billion, two hundred one million, sixty-six thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •