Base | Representation |
---|---|
bin | 101101101101001110101001… |
… | …101111010101000011101011 |
3 | 222100202100021111220001202121 |
4 | 231231032221233111003223 |
5 | 202322003333220024321 |
6 | 1551311223405212111 |
7 | 60225142001220130 |
oct | 5555165157250353 |
9 | 870670244801677 |
10 | 201020202111211 |
11 | 5906220956241a |
12 | 1a66708ab61037 |
13 | 882217ba78582 |
14 | 378d603124587 |
15 | 1838ee4196441 |
hex | b6d3a9bd50eb |
201020202111211 has 8 divisors (see below), whose sum is σ = 229737465946080. Its totient is φ = 172302961302528.
The previous prime is 201020202111133. The next prime is 201020202111257. The reversal of 201020202111211 is 112111202020102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201020202111211 - 219 = 201020201586923 is a prime.
It is a super-2 number, since 2×2010202021112112 (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 (201020202111611) 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, 21648585 + ... + 29507653.
It is an arithmetic number, because the mean of its divisors is an integer number (28717183243260).
Almost surely, 2201020202111211 is an apocalyptic number.
201020202111211 is a deficient number, since it is larger than the sum of its proper divisors (28717263834869).
201020202111211 is an equidigital number, since it uses as much as digits as its factorization.
201020202111211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11513093.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201020202111211 its reverse (112111202020102), we get a palindrome (313131404131313).
The spelling of 201020202111211 in words is "two hundred one trillion, twenty billion, two hundred two million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •