Base | Representation |
---|---|
bin | 1011101101100111000… |
… | …1011001100000101001 |
3 | 201020101111212211221122 |
4 | 2323121301121200221 |
5 | 11244100324213113 |
6 | 232235023545025 |
7 | 20352320431532 |
oct | 2733161314051 |
9 | 636344784848 |
10 | 201222101033 |
11 | 783796a2858 |
12 | 32bb8a5b175 |
13 | 15c8a581195 |
14 | 9a4c525689 |
15 | 537a8c8408 |
hex | 2ed9c59829 |
201222101033 has 2 divisors, whose sum is σ = 201222101034. Its totient is φ = 201222101032.
The previous prime is 201222101011. The next prime is 201222101123. The reversal of 201222101033 is 330101222102.
201222101033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 198249343504 + 2972757529 = 445252^2 + 54523^2 .
It is a cyclic number.
It is not a de Polignac number, because 201222101033 - 26 = 201222100969 is a prime.
It is not a weakly prime, because it can be changed into another prime (201222101533) 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, 100611050516 + 100611050517.
It is an arithmetic number, because the mean of its divisors is an integer number (100611050517).
Almost surely, 2201222101033 is an apocalyptic number.
It is an amenable number.
201222101033 is a deficient number, since it is larger than the sum of its proper divisors (1).
201222101033 is an equidigital number, since it uses as much as digits as its factorization.
201222101033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 201222101033 its reverse (330101222102), we get a palindrome (531323323135).
The spelling of 201222101033 in words is "two hundred one billion, two hundred twenty-two million, one hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •