Base | Representation |
---|---|
bin | 1001001001010101100001… |
… | …01011101001000011000011 |
3 | 2122012200120221022102011211 |
4 | 10210222300223221003003 |
5 | 10114003334241011321 |
6 | 110435154210350551 |
7 | 4144021064526613 |
oct | 444526053510303 |
9 | 78180527272154 |
10 | 20112001110211 |
11 | 64544a734293a |
12 | 2309a1058b457 |
13 | b2b72725640a |
14 | 4d75d7108a43 |
15 | 24d25c9b00e1 |
hex | 124ab0ae90c3 |
20112001110211 has 16 divisors (see below), whose sum is σ = 20236074150240. Its totient is φ = 19988258181120.
The previous prime is 20112001110181. The next prime is 20112001110221. The reversal of 20112001110211 is 11201110021102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 20112001110211 - 29 = 20112001109699 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20112001110191 and 20112001110200.
It is not an unprimeable number, because it can be changed into a prime (20112001110221) 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 in 15 ways as a sum of consecutive naturals, for example, 745234260 + ... + 745261246.
It is an arithmetic number, because the mean of its divisors is an integer number (1264754634390).
Almost surely, 220112001110211 is an apocalyptic number.
20112001110211 is a deficient number, since it is larger than the sum of its proper divisors (124073040029).
20112001110211 is a wasteful number, since it uses less digits than its factorization.
20112001110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32934.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20112001110211 its reverse (11201110021102), we get a palindrome (31313111131313).
The spelling of 20112001110211 in words is "twenty trillion, one hundred twelve billion, one million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •