Base | Representation |
---|---|
bin | 101111000010101100… |
… | …0010110110000011001 |
3 | 100122202101201102201002 |
4 | 1132011120112300121 |
5 | 3123343113032301 |
6 | 114224152034345 |
7 | 10204263564521 |
oct | 1360530266031 |
9 | 318671642632 |
10 | 101022002201 |
11 | 3993031751a |
12 | 176b40929b5 |
13 | 96ac481483 |
14 | 4c64a98681 |
15 | 2963d1516b |
hex | 1785616c19 |
101022002201 has 2 divisors, whose sum is σ = 101022002202. Its totient is φ = 101022002200.
The previous prime is 101022002197. The next prime is 101022002219. The reversal of 101022002201 is 102200220101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71997768976 + 29024233225 = 268324^2 + 170365^2 .
It is a cyclic number.
It is not a de Polignac number, because 101022002201 - 22 = 101022002197 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (101022032201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50511001100 + 50511001101.
It is an arithmetic number, because the mean of its divisors is an integer number (50511001101).
Almost surely, 2101022002201 is an apocalyptic number.
It is an amenable number.
101022002201 is a deficient number, since it is larger than the sum of its proper divisors (1).
101022002201 is an equidigital number, since it uses as much as digits as its factorization.
101022002201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 101022002201 its reverse (102200220101), we get a palindrome (203222222302).
The spelling of 101022002201 in words is "one hundred one billion, twenty-two million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •