Base | Representation |
---|---|
bin | 1011101100110110111… |
… | …0100001010111110011 |
3 | 201012212102122002011202 |
4 | 2323031232201113303 |
5 | 11243142111121321 |
6 | 232203004401415 |
7 | 20344314656603 |
oct | 2731556412763 |
9 | 635772562152 |
10 | 201020020211 |
11 | 7828561950a |
12 | 32b6124626b |
13 | 15c57748a2a |
14 | 9a2d760c03 |
15 | 5367cac70b |
hex | 2ecdba15f3 |
201020020211 has 8 divisors (see below), whose sum is σ = 210347067264. Its totient is φ = 191870631360.
The previous prime is 201020020193. The next prime is 201020020259. The reversal of 201020020211 is 112020020102.
It is a happy number.
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 201020020211 - 26 = 201020020147 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201020020192 and 201020020201.
It is not an unprimeable number, because it can be changed into a prime (201020020291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44412236 + ... + 44416761.
It is an arithmetic number, because the mean of its divisors is an integer number (26293383408).
Almost surely, 2201020020211 is an apocalyptic number.
201020020211 is a deficient number, since it is larger than the sum of its proper divisors (9327047053).
201020020211 is an equidigital number, since it uses as much as digits as its factorization.
201020020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88829101.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 201020020211 its reverse (112020020102), we get a palindrome (313040040313).
The spelling of 201020020211 in words is "two hundred one billion, twenty million, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •