Base | Representation |
---|---|
bin | 101101101110011011000001… |
… | …110110011111110011000101 |
3 | 222101001011221212010101022122 |
4 | 231232123001312133303011 |
5 | 202324324312010201041 |
6 | 1551413025204535325 |
7 | 60234104155365431 |
oct | 5556330166376305 |
9 | 871034855111278 |
10 | 201102211022021 |
11 | 59093a72441971 |
12 | 1a67ab576b1545 |
13 | 8829b1b1575ba |
14 | 37935829d79c1 |
15 | 183b1e3bd7c4b |
hex | b6e6c1d9fcc5 |
201102211022021 has 2 divisors, whose sum is σ = 201102211022022. Its totient is φ = 201102211022020.
The previous prime is 201102211021963. The next prime is 201102211022057. The reversal of 201102211022021 is 120220112201102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 193382787813796 + 7719423208225 = 13906214^2 + 2778385^2 .
It is a cyclic number.
It is not a de Polignac number, because 201102211022021 - 226 = 201102143913157 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201102211082021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100551105511010 + 100551105511011.
It is an arithmetic number, because the mean of its divisors is an integer number (100551105511011).
Almost surely, 2201102211022021 is an apocalyptic number.
It is an amenable number.
201102211022021 is a deficient number, since it is larger than the sum of its proper divisors (1).
201102211022021 is an equidigital number, since it uses as much as digits as its factorization.
201102211022021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 201102211022021 its reverse (120220112201102), we get a palindrome (321322323223123).
The spelling of 201102211022021 in words is "two hundred one trillion, one hundred two billion, two hundred eleven million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •