Base | Representation |
---|---|
bin | 1011101100110010001… |
… | …0111111100110101101 |
3 | 201012211001101011220101 |
4 | 2323030202333212231 |
5 | 11243122024033401 |
6 | 232201020151101 |
7 | 20343654455341 |
oct | 2731442774655 |
9 | 635731334811 |
10 | 201000221101 |
11 | 78275426109 |
12 | 32b56698491 |
13 | 15c53605b94 |
14 | 9a2ac89621 |
15 | 536619b101 |
hex | 2ecc8bf9ad |
201000221101 has 2 divisors, whose sum is σ = 201000221102. Its totient is φ = 201000221100.
The previous prime is 201000221047. The next prime is 201000221111. The reversal of 201000221101 is 101122000102.
It is an a-pointer prime, because the next prime (201000221111) can be obtained adding 201000221101 to its sum of digits (10).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 154818640900 + 46181580201 = 393470^2 + 214899^2 .
It is a cyclic number.
It is not a de Polignac number, because 201000221101 - 211 = 201000219053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201000221111) 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, 100500110550 + 100500110551.
It is an arithmetic number, because the mean of its divisors is an integer number (100500110551).
Almost surely, 2201000221101 is an apocalyptic number.
It is an amenable number.
201000221101 is a deficient number, since it is larger than the sum of its proper divisors (1).
201000221101 is an equidigital number, since it uses as much as digits as its factorization.
201000221101 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 10.
Adding to 201000221101 its reverse (101122000102), we get a palindrome (302122221203).
The spelling of 201000221101 in words is "two hundred one billion, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •