Base | Representation |
---|---|
bin | 10010101111111010… |
… | …000110000010010101 |
3 | 1220221222020101210222 |
4 | 102233322012002111 |
5 | 312212031023221 |
6 | 13125331324125 |
7 | 1311603422615 |
oct | 225772060225 |
9 | 56858211728 |
10 | 20131111061 |
11 | 85a053a776 |
12 | 3a99a50645 |
13 | 1b8a8c2049 |
14 | d8d894a45 |
15 | 7cc5189ab |
hex | 4afe86095 |
20131111061 has 2 divisors, whose sum is σ = 20131111062. Its totient is φ = 20131111060.
The previous prime is 20131111027. The next prime is 20131111079. The reversal of 20131111061 is 16011113102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19552708561 + 578402500 = 139831^2 + 24050^2 .
It is a cyclic number.
It is not a de Polignac number, because 20131111061 - 214 = 20131094677 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20131111001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10065555530 + 10065555531.
It is an arithmetic number, because the mean of its divisors is an integer number (10065555531).
Almost surely, 220131111061 is an apocalyptic number.
It is an amenable number.
20131111061 is a deficient number, since it is larger than the sum of its proper divisors (1).
20131111061 is an equidigital number, since it uses as much as digits as its factorization.
20131111061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 20131111061 its reverse (16011113102), we get a palindrome (36142224163).
The spelling of 20131111061 in words is "twenty billion, one hundred thirty-one million, one hundred eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •