Base | Representation |
---|---|
bin | 10001011111100011011… |
… | …010010011101111001001 |
3 | 11020220212012022012012111 |
4 | 101133203122103233021 |
5 | 124143410431401301 |
6 | 2320124154542321 |
7 | 152564302415452 |
oct | 21374332235711 |
9 | 4226765265174 |
10 | 1202111200201 |
11 | 4238a348504a |
12 | 174b887379a1 |
13 | 89487ac77b2 |
14 | 4227aa8c129 |
15 | 2140a216551 |
hex | 117e3693bc9 |
1202111200201 has 2 divisors, whose sum is σ = 1202111200202. Its totient is φ = 1202111200200.
The previous prime is 1202111200151. The next prime is 1202111200247. The reversal of 1202111200201 is 1020021112021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 712503121801 + 489608078400 = 844099^2 + 699720^2 .
It is an emirp because it is prime and its reverse (1020021112021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1202111200201 - 29 = 1202111199689 is a prime.
It is not a weakly prime, because it can be changed into another prime (1202111200261) 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, 601055600100 + 601055600101.
It is an arithmetic number, because the mean of its divisors is an integer number (601055600101).
Almost surely, 21202111200201 is an apocalyptic number.
It is an amenable number.
1202111200201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1202111200201 is an equidigital number, since it uses as much as digits as its factorization.
1202111200201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1202111200201 its reverse (1020021112021), we get a palindrome (2222132312222).
The spelling of 1202111200201 in words is "one trillion, two hundred two billion, one hundred eleven million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •