Base | Representation |
---|---|
bin | 10010101110110101… |
… | …000010111000100011 |
3 | 1220220201011210010010 |
4 | 102232311002320203 |
5 | 312142412311321 |
6 | 13123443340003 |
7 | 1311263523510 |
oct | 225665027043 |
9 | 56821153103 |
10 | 20113010211 |
11 | 85912a7298 |
12 | 3a93981603 |
13 | 1b86c25198 |
14 | d8b302307 |
15 | 7cab40676 |
hex | 4aed42e23 |
20113010211 has 24 divisors (see below), whose sum is σ = 31668978432. Its totient is φ = 11122390800.
The previous prime is 20113010173. The next prime is 20113010249. The reversal of 20113010211 is 11201031102.
It is an interprime number because it is at equal distance from previous prime (20113010173) and next prime (20113010249).
It is not a de Polignac number, because 20113010211 - 26 = 20113010147 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20113010011) 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 in 23 ways as a sum of consecutive naturals, for example, 478135 + ... + 518496.
It is an arithmetic number, because the mean of its divisors is an integer number (1319540768).
Almost surely, 220113010211 is an apocalyptic number.
20113010211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20113010211 is a deficient number, since it is larger than the sum of its proper divisors (11555968221).
20113010211 is an equidigital number, since it uses as much as digits as its factorization.
20113010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 996703 (or 996672 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 20113010211 its reverse (11201031102), we get a palindrome (31314041313).
The spelling of 20113010211 in words is "twenty billion, one hundred thirteen million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •