Base | Representation |
---|---|
bin | 1011110001010101001… |
… | …1111111001101100101 |
3 | 201022222010112101210022 |
4 | 2330111103333031211 |
5 | 11303122040232401 |
6 | 232522110204525 |
7 | 20416140225635 |
oct | 2742523771545 |
9 | 638863471708 |
10 | 202221024101 |
11 | 78841550508 |
12 | 332374b3745 |
13 | 160b9502115 |
14 | 9b050726c5 |
15 | 53d844571b |
hex | 2f154ff365 |
202221024101 has 2 divisors, whose sum is σ = 202221024102. Its totient is φ = 202221024100.
The previous prime is 202221024079. The next prime is 202221024139. The reversal of 202221024101 is 101420122202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 186943816900 + 15277207201 = 432370^2 + 123601^2 .
It is a cyclic number.
It is not a de Polignac number, because 202221024101 - 26 = 202221024037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 202221024101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202221024701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101110512050 + 101110512051.
It is an arithmetic number, because the mean of its divisors is an integer number (101110512051).
Almost surely, 2202221024101 is an apocalyptic number.
It is an amenable number.
202221024101 is a deficient number, since it is larger than the sum of its proper divisors (1).
202221024101 is an equidigital number, since it uses as much as digits as its factorization.
202221024101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 202221024101 its reverse (101420122202), we get a palindrome (303641146303).
The spelling of 202221024101 in words is "two hundred two billion, two hundred twenty-one million, twenty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •