Base | Representation |
---|---|
bin | 101110110011110010… |
… | …111011000100101001 |
3 | 11210201210010222200122 |
4 | 232303302323010221 |
5 | 1310413321023311 |
6 | 35031210013025 |
7 | 3426342252356 |
oct | 566362730451 |
9 | 153653128618 |
10 | 50261111081 |
11 | 1a3520a5735 |
12 | 98a8417175 |
13 | 497cba291c |
14 | 260b29d62d |
15 | 14927710db |
hex | bb3cbb129 |
50261111081 has 2 divisors, whose sum is σ = 50261111082. Its totient is φ = 50261111080.
The previous prime is 50261111071. The next prime is 50261111113. The reversal of 50261111081 is 18011116205.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 50202435481 + 58675600 = 224059^2 + 7660^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50261111081 is a prime.
It is a super-3 number, since 3×502611110813 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 50261111081.
It is not a weakly prime, because it can be changed into another prime (50261111041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25130555540 + 25130555541.
It is an arithmetic number, because the mean of its divisors is an integer number (25130555541).
Almost surely, 250261111081 is an apocalyptic number.
It is an amenable number.
50261111081 is a deficient number, since it is larger than the sum of its proper divisors (1).
50261111081 is an equidigital number, since it uses as much as digits as its factorization.
50261111081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 480, while the sum is 26.
Adding to 50261111081 its reverse (18011116205), we get a palindrome (68272227286).
The spelling of 50261111081 in words is "fifty billion, two hundred sixty-one million, one hundred eleven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.186 sec. • engine limits •