Base | Representation |
---|---|
bin | 101101101110100010011000… |
… | …001100111111110110100001 |
3 | 222101001221022210210100221012 |
4 | 231232202120030333312201 |
5 | 202324441442131241001 |
6 | 1551420412220310305 |
7 | 60234503545401263 |
oct | 5556423014776641 |
9 | 871057283710835 |
10 | 201110102212001 |
11 | 59097351850784 |
12 | 1a68059a3a2395 |
13 | 882a7a7c90b98 |
14 | 3793ad0a59b33 |
15 | 183b50688d2bb |
hex | b6e89833fda1 |
201110102212001 has 2 divisors, whose sum is σ = 201110102212002. Its totient is φ = 201110102212000.
The previous prime is 201110102211979. The next prime is 201110102212003. The reversal of 201110102212001 is 100212201011102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 168290322600976 + 32819779611025 = 12972676^2 + 5728855^2 .
It is a cyclic number.
It is not a de Polignac number, because 201110102212001 - 214 = 201110102195617 is a prime.
Together with 201110102212003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (201110102212003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100555051106000 + 100555051106001.
It is an arithmetic number, because the mean of its divisors is an integer number (100555051106001).
Almost surely, 2201110102212001 is an apocalyptic number.
It is an amenable number.
201110102212001 is a deficient number, since it is larger than the sum of its proper divisors (1).
201110102212001 is an equidigital number, since it uses as much as digits as its factorization.
201110102212001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 201110102212001 its reverse (100212201011102), we get a palindrome (301322303223103).
The spelling of 201110102212001 in words is "two hundred one trillion, one hundred ten billion, one hundred two million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •