Base | Representation |
---|---|
bin | 1011101101001010011… |
… | …1101000101100111111 |
3 | 201020002011002020021111 |
4 | 2323102213220230333 |
5 | 11243324114220221 |
6 | 232215055542451 |
7 | 20346332441236 |
oct | 2732247505477 |
9 | 636064066244 |
10 | 201102101311 |
11 | 78317991231 |
12 | 32b8482aa27 |
13 | 15c6b757427 |
14 | 9a3a609b1d |
15 | 53700c2be1 |
hex | 2ed29e8b3f |
201102101311 has 8 divisors (see below), whose sum is σ = 205615097280. Its totient is φ = 196598864928.
The previous prime is 201102101303. The next prime is 201102101359. The reversal of 201102101311 is 113101201102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201102101311 - 23 = 201102101303 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201102101291 and 201102101300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201102101381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2398216 + ... + 2480653.
It is an arithmetic number, because the mean of its divisors is an integer number (25701887160).
Almost surely, 2201102101311 is an apocalyptic number.
201102101311 is a deficient number, since it is larger than the sum of its proper divisors (4512995969).
201102101311 is an equidigital number, since it uses as much as digits as its factorization.
201102101311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4879793.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 201102101311 its reverse (113101201102), we get a palindrome (314203302413).
The spelling of 201102101311 in words is "two hundred one billion, one hundred two million, one hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •