Base | Representation |
---|---|
bin | 101101101110011010110101… |
… | …010110001011001001000011 |
3 | 222101001011102020100110002022 |
4 | 231232122311112023021003 |
5 | 202324323344303102321 |
6 | 1551412552312112055 |
7 | 60234066030204245 |
oct | 5556326526131103 |
9 | 871034366313068 |
10 | 201102001222211 |
11 | 59093974a761a1 |
12 | 1a67aab939562b |
13 | 8829ab684b8bb |
14 | 3793562bc4095 |
15 | 183b1d0594dab |
hex | b6e6b558b243 |
201102001222211 has 4 divisors (see below), whose sum is σ = 202306204822512. Its totient is φ = 199897797621912.
The previous prime is 201102001222201. The next prime is 201102001222253. The reversal of 201102001222211 is 112222100201102.
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 201102001222211 - 218 = 201102000960067 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201102001222211.
It is not an unprimeable number, because it can be changed into a prime (201102001222201) 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, 602101799900 + ... + 602101800233.
It is an arithmetic number, because the mean of its divisors is an integer number (50576551205628).
Almost surely, 2201102001222211 is an apocalyptic number.
201102001222211 is a deficient number, since it is larger than the sum of its proper divisors (1204203600301).
201102001222211 is a wasteful number, since it uses less digits than its factorization.
201102001222211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1204203600300.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 201102001222211 its reverse (112222100201102), we get a palindrome (313324101423313).
The spelling of 201102001222211 in words is "two hundred one trillion, one hundred two billion, one million, two hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •