Base | Representation |
---|---|
bin | 1011101100111100101… |
… | …0000000000110111011 |
3 | 201012221002202102220221 |
4 | 2323033022000012323 |
5 | 11243214231014321 |
6 | 232205222400511 |
7 | 20345025546214 |
oct | 2731712000673 |
9 | 635832672827 |
10 | 201044001211 |
11 | 78298108819 |
12 | 32b69290137 |
13 | 15c5c6c4181 |
14 | 9a32a0440b |
15 | 5369e47e41 |
hex | 2ecf2801bb |
201044001211 has 8 divisors (see below), whose sum is σ = 201943229760. Its totient is φ = 200144892168.
The previous prime is 201044001203. The next prime is 201044001271. The reversal of 201044001211 is 112100440102.
It is a happy number.
201044001211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 201044001211 - 23 = 201044001203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201044001271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6644860 + ... + 6675046.
It is an arithmetic number, because the mean of its divisors is an integer number (25242903720).
Almost surely, 2201044001211 is an apocalyptic number.
201044001211 is a deficient number, since it is larger than the sum of its proper divisors (899228549).
201044001211 is a wasteful number, since it uses less digits than its factorization.
201044001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59753.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 201044001211 its reverse (112100440102), we get a palindrome (313144441313).
The spelling of 201044001211 in words is "two hundred one billion, forty-four million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •