Base | Representation |
---|---|
bin | 1011101100110100110… |
… | …0001001101010100011 |
3 | 201012211210200022210001 |
4 | 2323031030021222203 |
5 | 11243132304311321 |
6 | 232202043320431 |
7 | 20344145252434 |
oct | 2731514115243 |
9 | 635753608701 |
10 | 201011010211 |
11 | 78280525130 |
12 | 32b5a220117 |
13 | 15c5591297b |
14 | 9a2c49748b |
15 | 53670ccc91 |
hex | 2ecd309aa3 |
201011010211 has 16 divisors (see below), whose sum is σ = 219775978080. Its totient is φ = 182328340480.
The previous prime is 201011010203. The next prime is 201011010223. The reversal of 201011010211 is 112010110102.
201011010211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 201011010211 - 23 = 201011010203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201011013211) 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, 10483245 + ... + 10502401.
It is an arithmetic number, because the mean of its divisors is an integer number (13735998630).
Almost surely, 2201011010211 is an apocalyptic number.
201011010211 is a deficient number, since it is larger than the sum of its proper divisors (18764967869).
201011010211 is a wasteful number, since it uses less digits than its factorization.
201011010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21254.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 201011010211 its reverse (112010110102), we get a palindrome (313021120313).
It can be divided in two parts, 2010110102 and 11, that multiplied together give a palindrome (22111211122).
The spelling of 201011010211 in words is "two hundred one billion, eleven million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •