Base | Representation |
---|---|
bin | 1011101101111110101… |
… | …1000011011001100101 |
3 | 201020122102011120020102 |
4 | 2323133223003121211 |
5 | 11244301200212101 |
6 | 232252521513445 |
7 | 20354632060064 |
oct | 2733753033145 |
9 | 636572146212 |
10 | 201321100901 |
11 | 7841a570928 |
12 | 33026042885 |
13 | 15ca4c3469b |
14 | 9a5b7361db |
15 | 538443186b |
hex | 2edfac3665 |
201321100901 has 2 divisors, whose sum is σ = 201321100902. Its totient is φ = 201321100900.
The previous prime is 201321100853. The next prime is 201321100921. The reversal of 201321100901 is 109001123102.
It is an a-pointer prime, because the next prime (201321100921) can be obtained adding 201321100901 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 123307024801 + 78014076100 = 351151^2 + 279310^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201321100901 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 (201321100921) 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, 100660550450 + 100660550451.
It is an arithmetic number, because the mean of its divisors is an integer number (100660550451).
Almost surely, 2201321100901 is an apocalyptic number.
It is an amenable number.
201321100901 is a deficient number, since it is larger than the sum of its proper divisors (1).
201321100901 is an equidigital number, since it uses as much as digits as its factorization.
201321100901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
The spelling of 201321100901 in words is "two hundred one billion, three hundred twenty-one million, one hundred thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •