Base | Representation |
---|---|
bin | 101101111101000110100011… |
… | …100011011011100111000011 |
3 | 222111121121212111020101022222 |
4 | 231331012203203123213003 |
5 | 202442341332111202321 |
6 | 1553504304254521255 |
7 | 60400016326404656 |
oct | 5575064343334703 |
9 | 874547774211288 |
10 | 202111020022211 |
11 | 59442890863003 |
12 | 1a80257780622b |
13 | 88a0cab44a891 |
14 | 37ca322d3789d |
15 | 185758899d3ab |
hex | b7d1a38db9c3 |
202111020022211 has 8 divisors (see below), whose sum is σ = 204089792385024. Its totient is φ = 200132565533640.
The previous prime is 202111020022159. The next prime is 202111020022213. The reversal of 202111020022211 is 112220020111202.
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 202111020022211 - 26 = 202111020022147 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 202111020022211.
It is not an unprimeable number, because it can be changed into a prime (202111020022213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78190595 + ... + 80734076.
It is an arithmetic number, because the mean of its divisors is an integer number (25511224048128).
Almost surely, 2202111020022211 is an apocalyptic number.
202111020022211 is a deficient number, since it is larger than the sum of its proper divisors (1978772362813).
202111020022211 is a wasteful number, since it uses less digits than its factorization.
202111020022211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158937121.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 202111020022211 its reverse (112220020111202), we get a palindrome (314331040133413).
The spelling of 202111020022211 in words is "two hundred two trillion, one hundred eleven billion, twenty million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •