Base | Representation |
---|---|
bin | 10010101110110000… |
… | …000011010111111101 |
3 | 1220220121201021220101 |
4 | 102232300003113331 |
5 | 312142043422001 |
6 | 13123355321101 |
7 | 1311246433153 |
oct | 225660032775 |
9 | 56817637811 |
10 | 20111701501 |
11 | 8590593011 |
12 | 3a93450191 |
13 | 1b868875b8 |
14 | d8b0813d3 |
15 | 7ca982a01 |
hex | 4aec035fd |
20111701501 has 2 divisors, whose sum is σ = 20111701502. Its totient is φ = 20111701500.
The previous prime is 20111701499. The next prime is 20111701559. The reversal of 20111701501 is 10510711102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20092779001 + 18922500 = 141749^2 + 4350^2 .
It is a cyclic number.
It is not a de Polignac number, because 20111701501 - 21 = 20111701499 is a prime.
It is a super-3 number, since 3×201117015013 (a number of 32 digits) contains 333 as substring.
Together with 20111701499, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20111701601) 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 as a sum of consecutive naturals, namely, 10055850750 + 10055850751.
It is an arithmetic number, because the mean of its divisors is an integer number (10055850751).
Almost surely, 220111701501 is an apocalyptic number.
It is an amenable number.
20111701501 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111701501 is an equidigital number, since it uses as much as digits as its factorization.
20111701501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 70, while the sum is 19.
The spelling of 20111701501 in words is "twenty billion, one hundred eleven million, seven hundred one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •