Base | Representation |
---|---|
bin | 1011101101100100010… |
… | …0000010111010101011 |
3 | 201020100200111211021111 |
4 | 2323121010002322223 |
5 | 11244034303241021 |
6 | 232233521051151 |
7 | 20352114403624 |
oct | 2733104027253 |
9 | 636320454244 |
10 | 201210212011 |
11 | 78372a12416 |
12 | 32bb4a86ab7 |
13 | 15c87c7a863 |
14 | 9a4ab0ca4b |
15 | 537982a8e1 |
hex | 2ed9102eab |
201210212011 has 16 divisors (see below), whose sum is σ = 206473190400. Its totient is φ = 196024390848.
The previous prime is 201210211981. The next prime is 201210212029. The reversal of 201210212011 is 110212012102.
201210212011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 201210212011 - 27 = 201210211883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201210211982 and 201210212000.
It is not an unprimeable number, because it can be changed into a prime (201210212611) 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 15 ways as a sum of consecutive naturals, for example, 3394716 + ... + 3453478.
It is an arithmetic number, because the mean of its divisors is an integer number (12904574400).
Almost surely, 2201210212011 is an apocalyptic number.
201210212011 is a deficient number, since it is larger than the sum of its proper divisors (5262978389).
201210212011 is an equidigital number, since it uses as much as digits as its factorization.
201210212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59418.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201210212011 its reverse (110212012102), we get a palindrome (311422224113).
The spelling of 201210212011 in words is "two hundred one billion, two hundred ten million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •