Base | Representation |
---|---|
bin | 1011101101001010011… |
… | …1010010101100010001 |
3 | 201020002010220122121022 |
4 | 2323102213102230101 |
5 | 11243324103324103 |
6 | 232215054005225 |
7 | 20346331614341 |
oct | 2732247225421 |
9 | 636063818538 |
10 | 201102011153 |
11 | 7831792a51a |
12 | 32b847a6815 |
13 | 15c6b725394 |
14 | 9a3a5c4d21 |
15 | 53700a6138 |
hex | 2ed29d2b11 |
201102011153 has 2 divisors, whose sum is σ = 201102011154. Its totient is φ = 201102011152.
The previous prime is 201102011137. The next prime is 201102011179. The reversal of 201102011153 is 351110201102.
201102011153 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., 164700423889 + 36401587264 = 405833^2 + 190792^2 .
It is a cyclic number.
It is not a de Polignac number, because 201102011153 - 24 = 201102011137 is a prime.
It is not a weakly prime, because it can be changed into another prime (201102014153) 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, 100551005576 + 100551005577.
It is an arithmetic number, because the mean of its divisors is an integer number (100551005577).
Almost surely, 2201102011153 is an apocalyptic number.
It is an amenable number.
201102011153 is a deficient number, since it is larger than the sum of its proper divisors (1).
201102011153 is an equidigital number, since it uses as much as digits as its factorization.
201102011153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 17.
Adding to 201102011153 its reverse (351110201102), we get a palindrome (552212212255).
The spelling of 201102011153 in words is "two hundred one billion, one hundred two million, eleven thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •