Base | Representation |
---|---|
bin | 101101101101000110000110… |
… | …100000001011000111111011 |
3 | 222100201110120200000100112111 |
4 | 231231012012200023013323 |
5 | 202321331032334014321 |
6 | 1551303104354153151 |
7 | 60224365326115441 |
oct | 5555060640130773 |
9 | 870643520010474 |
10 | 201011021001211 |
11 | 59059328010603 |
12 | 1a6653482827b7 |
13 | 88213479260c5 |
14 | 378cdb1a46b91 |
15 | 1838b581425e1 |
hex | b6d18680b1fb |
201011021001211 has 2 divisors, whose sum is σ = 201011021001212. Its totient is φ = 201011021001210.
The previous prime is 201011021001191. The next prime is 201011021001221. The reversal of 201011021001211 is 112100120110102.
It is a happy number.
201011021001211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201011021001211 - 229 = 201010484130299 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201011021001191 and 201011021001200.
It is not a weakly prime, because it can be changed into another prime (201011021001221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100505510500605 + 100505510500606.
It is an arithmetic number, because the mean of its divisors is an integer number (100505510500606).
Almost surely, 2201011021001211 is an apocalyptic number.
201011021001211 is a deficient number, since it is larger than the sum of its proper divisors (1).
201011021001211 is an equidigital number, since it uses as much as digits as its factorization.
201011021001211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 201011021001211 its reverse (112100120110102), we get a palindrome (313111141111313).
The spelling of 201011021001211 in words is "two hundred one trillion, eleven billion, twenty-one million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •