Base | Representation |
---|---|
bin | 101101101101000101010110… |
… | …001010110110101010100101 |
3 | 222100201101111011011121110022 |
4 | 231231011112022312222211 |
5 | 202321322402241343041 |
6 | 1551302452110004525 |
7 | 60224336251453511 |
oct | 5555052612665245 |
9 | 870641434147408 |
10 | 201010210106021 |
11 | 59058a51308a98 |
12 | 1a6651607a6745 |
13 | 882124892a074 |
14 | 378cd36083141 |
15 | 1838b0bd6724b |
hex | b6d1562b6aa5 |
201010210106021 has 2 divisors, whose sum is σ = 201010210106022. Its totient is φ = 201010210106020.
The previous prime is 201010210105993. The next prime is 201010210106023. The reversal of 201010210106021 is 120601012010102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 197973032543521 + 3037177562500 = 14070289^2 + 1742750^2 .
It is a cyclic number.
It is not a de Polignac number, because 201010210106021 - 222 = 201010205911717 is a prime.
Together with 201010210106023, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201010210106023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100505105053010 + 100505105053011.
It is an arithmetic number, because the mean of its divisors is an integer number (100505105053011).
Almost surely, 2201010210106021 is an apocalyptic number.
It is an amenable number.
201010210106021 is a deficient number, since it is larger than the sum of its proper divisors (1).
201010210106021 is an equidigital number, since it uses as much as digits as its factorization.
201010210106021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 201010210106021 its reverse (120601012010102), we get a palindrome (321611222116123).
The spelling of 201010210106021 in words is "two hundred one trillion, ten billion, two hundred ten million, one hundred six thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •