Base | Representation |
---|---|
bin | 101111000101000011… |
… | …0011110101100011001 |
3 | 100122221220202012200102 |
4 | 1132022012132230121 |
5 | 3124023401432301 |
6 | 114240101345145 |
7 | 10206245016356 |
oct | 1361206365431 |
9 | 318856665612 |
10 | 101101202201 |
11 | 39970aa166a |
12 | 177167081b5 |
13 | 96c29c168c |
14 | 4c713d362d |
15 | 296ac5bb6b |
hex | 178a19eb19 |
101101202201 has 2 divisors, whose sum is σ = 101101202202. Its totient is φ = 101101202200.
The previous prime is 101101202149. The next prime is 101101202203. The reversal of 101101202201 is 102202101101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96571777600 + 4529424601 = 310760^2 + 67301^2 .
It is a cyclic number.
It is not a de Polignac number, because 101101202201 - 222 = 101097007897 is a prime.
It is a Sophie Germain prime.
Together with 101101202203, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (101101202203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550601100 + 50550601101.
It is an arithmetic number, because the mean of its divisors is an integer number (50550601101).
Almost surely, 2101101202201 is an apocalyptic number.
It is an amenable number.
101101202201 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101202201 is an equidigital number, since it uses as much as digits as its factorization.
101101202201 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 11.
Adding to 101101202201 its reverse (102202101101), we get a palindrome (203303303302).
The spelling of 101101202201 in words is "one hundred one billion, one hundred one million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •