Base | Representation |
---|---|
bin | 101101101110011010110101… |
… | …010110001000011101001011 |
3 | 222101001011102020022212222220 |
4 | 231232122311112020131023 |
5 | 202324323344302224321 |
6 | 1551412552311545123 |
7 | 60234066030130212 |
oct | 5556326526103513 |
9 | 871034366285886 |
10 | 201102001211211 |
11 | 59093974a68a01 |
12 | 1a67aab938b1a3 |
13 | 8829ab68468a9 |
14 | 3793562bc0079 |
15 | 183b1d05919c6 |
hex | b6e6b558874b |
201102001211211 has 4 divisors (see below), whose sum is σ = 268136001614952. Its totient is φ = 134068000807472.
The previous prime is 201102001211207. The next prime is 201102001211231. The reversal of 201102001211211 is 112112100201102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201102001211211 - 22 = 201102001211207 is a prime.
It is a super-2 number, since 2×2011020012112112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201102001211201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33517000201866 + ... + 33517000201871.
It is an arithmetic number, because the mean of its divisors is an integer number (67034000403738).
Almost surely, 2201102001211211 is an apocalyptic number.
201102001211211 is a deficient number, since it is larger than the sum of its proper divisors (67034000403741).
201102001211211 is an equidigital number, since it uses as much as digits as its factorization.
201102001211211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67034000403740.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 201102001211211 its reverse (112112100201102), we get a palindrome (313214101412313).
The spelling of 201102001211211 in words is "two hundred one trillion, one hundred two billion, one million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •