Base | Representation |
---|---|
bin | 1011101101111110111… |
… | …0100001100111011101 |
3 | 201020122110212210210112 |
4 | 2323133232201213131 |
5 | 11244301413323401 |
6 | 232252553215405 |
7 | 20354642600531 |
oct | 2733756414735 |
9 | 636573783715 |
10 | 201322011101 |
11 | 78420032762 |
12 | 33026401565 |
13 | 15ca5192a73 |
14 | 9a5b8d1bc1 |
15 | 53845613bb |
hex | 2edfba19dd |
201322011101 has 2 divisors, whose sum is σ = 201322011102. Its totient is φ = 201322011100.
The previous prime is 201322011049. The next prime is 201322011109. The reversal of 201322011101 is 101110223102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 200591119876 + 730891225 = 447874^2 + 27035^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201322011101 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201322011109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100661005550 + 100661005551.
It is an arithmetic number, because the mean of its divisors is an integer number (100661005551).
Almost surely, 2201322011101 is an apocalyptic number.
It is an amenable number.
201322011101 is a deficient number, since it is larger than the sum of its proper divisors (1).
201322011101 is an equidigital number, since it uses as much as digits as its factorization.
201322011101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 201322011101 its reverse (101110223102), we get a palindrome (302432234203).
The spelling of 201322011101 in words is "two hundred one billion, three hundred twenty-two million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •