Base | Representation |
---|---|
bin | 101101101110011010111011… |
… | …010010110101101100001011 |
3 | 222101001011200012010020212012 |
4 | 231232122323102311230023 |
5 | 202324324100324324321 |
6 | 1551413010235010135 |
7 | 60234101351330261 |
oct | 5556327322655413 |
9 | 871034605106765 |
10 | 201102101011211 |
11 | 59093a16333144 |
12 | 1a67ab2689994b |
13 | 8829b0141a34a |
14 | 379357215c431 |
15 | 183b1d920705b |
hex | b6e6bb4b5b0b |
201102101011211 has 4 divisors (see below), whose sum is σ = 201102217320432. Its totient is φ = 201101984701992.
The previous prime is 201102101011171. The next prime is 201102101011291. The reversal of 201102101011211 is 112110101201102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201102101011211 is a prime.
It is a super-2 number, since 2×2011021010112112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201102101011291) 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, 55521320 + ... + 59032373.
It is an arithmetic number, because the mean of its divisors is an integer number (50275554330108).
Almost surely, 2201102101011211 is an apocalyptic number.
201102101011211 is a deficient number, since it is larger than the sum of its proper divisors (116309221).
201102101011211 is a wasteful number, since it uses less digits than its factorization.
201102101011211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116309220.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 201102101011211 its reverse (112110101201102), we get a palindrome (313212202212313).
The spelling of 201102101011211 in words is "two hundred one trillion, one hundred two billion, one hundred one million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •