Base | Representation |
---|---|
bin | 1011101101001101000… |
… | …1111110101001111001 |
3 | 201020002220222011120012 |
4 | 2323103101332221321 |
5 | 11243334434420043 |
6 | 232220133511305 |
7 | 20346526001525 |
oct | 2732321765171 |
9 | 636086864505 |
10 | 201113201273 |
11 | 78323182856 |
12 | 32b884a2535 |
13 | 15c70b4285a |
14 | 9a3bc98d85 |
15 | 5371066a18 |
hex | 2ed347ea79 |
201113201273 has 2 divisors, whose sum is σ = 201113201274. Its totient is φ = 201113201272.
The previous prime is 201113201197. The next prime is 201113201309. The reversal of 201113201273 is 372102311102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 200599181689 + 514019584 = 447883^2 + 22672^2 .
It is a cyclic number.
It is not a de Polignac number, because 201113201273 - 28 = 201113201017 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (201113201173) 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, 100556600636 + 100556600637.
It is an arithmetic number, because the mean of its divisors is an integer number (100556600637).
Almost surely, 2201113201273 is an apocalyptic number.
It is an amenable number.
201113201273 is a deficient number, since it is larger than the sum of its proper divisors (1).
201113201273 is an equidigital number, since it uses as much as digits as its factorization.
201113201273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 201113201273 its reverse (372102311102), we get a palindrome (573215512375).
The spelling of 201113201273 in words is "two hundred one billion, one hundred thirteen million, two hundred one thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •