Base | Representation |
---|---|
bin | 101101101100111100111101… |
… | …110010010111110000110011 |
3 | 222100200112020222221202012211 |
4 | 231230330331302113300303 |
5 | 202321200440020201321 |
6 | 1551254403122032551 |
7 | 60223600250253124 |
oct | 5554747562276063 |
9 | 870615228852184 |
10 | 201001211100211 |
11 | 59055153636805 |
12 | 1a66346aaa8757 |
13 | 8820443437462 |
14 | 378c720c4a04b |
15 | 1838781cd50e1 |
hex | b6cf3dc97c33 |
201001211100211 has 2 divisors, whose sum is σ = 201001211100212. Its totient is φ = 201001211100210.
The previous prime is 201001211100191. The next prime is 201001211100233. The reversal of 201001211100211 is 112001112100102.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 201001211100211 - 227 = 201001076882483 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201001211100191 and 201001211100200.
It is not a weakly prime, because it can be changed into another prime (201001211100281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100500605550105 + 100500605550106.
It is an arithmetic number, because the mean of its divisors is an integer number (100500605550106).
Almost surely, 2201001211100211 is an apocalyptic number.
201001211100211 is a deficient number, since it is larger than the sum of its proper divisors (1).
201001211100211 is an equidigital number, since it uses as much as digits as its factorization.
201001211100211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 201001211100211 its reverse (112001112100102), we get a palindrome (313002323200313).
The spelling of 201001211100211 in words is "two hundred one trillion, one billion, two hundred eleven million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •