Base | Representation |
---|---|
bin | 101101101101010000010101… |
… | …100011101100100010110011 |
3 | 222100202111221120122012002010 |
4 | 231231100111203230202303 |
5 | 202322021034304013021 |
6 | 1551312123104054003 |
7 | 60225234554431254 |
oct | 5555202543544263 |
9 | 870674846565063 |
10 | 201022011001011 |
11 | 59062a57639072 |
12 | 1a6674b4904303 |
13 | 88223a975ba75 |
14 | 378d735472b2b |
15 | 183909cda8976 |
hex | b6d4158ec8b3 |
201022011001011 has 4 divisors (see below), whose sum is σ = 268029348001352. Its totient is φ = 134014674000672.
The previous prime is 201022011000989. The next prime is 201022011001073. The reversal of 201022011001011 is 110100110220102.
201022011001011 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 201022011001011 - 219 = 201022010476723 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201022011701011) 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, 33503668500166 + ... + 33503668500171.
It is an arithmetic number, because the mean of its divisors is an integer number (67007337000338).
Almost surely, 2201022011001011 is an apocalyptic number.
201022011001011 is a deficient number, since it is larger than the sum of its proper divisors (67007337000341).
201022011001011 is an equidigital number, since it uses as much as digits as its factorization.
201022011001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67007337000340.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201022011001011 its reverse (110100110220102), we get a palindrome (311122121221113).
The spelling of 201022011001011 in words is "two hundred one trillion, twenty-two billion, eleven million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •