Base | Representation |
---|---|
bin | 10010101110110110… |
… | …100100100001010011 |
3 | 1220220201221002200222 |
4 | 102232312210201103 |
5 | 312143013111011 |
6 | 13123500103255 |
7 | 1311300110453 |
oct | 225666444123 |
9 | 56821832628 |
10 | 20113410131 |
11 | 859154a801 |
12 | 3a93b34b2b |
13 | 1b87035219 |
14 | d8b3a7d63 |
15 | 7cabbdddb |
hex | 4aeda4853 |
20113410131 has 2 divisors, whose sum is σ = 20113410132. Its totient is φ = 20113410130.
The previous prime is 20113410113. The next prime is 20113410133. The reversal of 20113410131 is 13101431102.
Together with previous prime (20113410113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20113410131 - 218 = 20113147987 is a prime.
It is a super-2 number, since 2×201134101312 (a number of 21 digits) contains 22 as substring.
Together with 20113410133, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (20113410133) 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, 10056705065 + 10056705066.
It is an arithmetic number, because the mean of its divisors is an integer number (10056705066).
Almost surely, 220113410131 is an apocalyptic number.
20113410131 is a deficient number, since it is larger than the sum of its proper divisors (1).
20113410131 is an equidigital number, since it uses as much as digits as its factorization.
20113410131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 20113410131 its reverse (13101431102), we get a palindrome (33214841233).
The spelling of 20113410131 in words is "twenty billion, one hundred thirteen million, four hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •