Base | Representation |
---|---|
bin | 10001011111100011010… |
… | …110011111100100001001 |
3 | 11020220212010102101021201 |
4 | 101133203112133210021 |
5 | 124143410202400243 |
6 | 2320124121304201 |
7 | 152564261051566 |
oct | 21374326374411 |
9 | 4226763371251 |
10 | 1202110200073 |
11 | 4238a29616a2 |
12 | 174b88335061 |
13 | 894878374c3 |
14 | 4227a8ab86d |
15 | 2140a0ba04d |
hex | 117e359f909 |
1202110200073 has 2 divisors, whose sum is σ = 1202110200074. Its totient is φ = 1202110200072.
The previous prime is 1202110200001. The next prime is 1202110200091. The reversal of 1202110200073 is 3700020112021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 828296571664 + 373813628409 = 910108^2 + 611403^2 .
It is an emirp because it is prime and its reverse (3700020112021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1202110200073 - 217 = 1202110069001 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1202110200073.
It is not a weakly prime, because it can be changed into another prime (1202110900073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 601055100036 + 601055100037.
It is an arithmetic number, because the mean of its divisors is an integer number (601055100037).
Almost surely, 21202110200073 is an apocalyptic number.
It is an amenable number.
1202110200073 is a deficient number, since it is larger than the sum of its proper divisors (1).
1202110200073 is an equidigital number, since it uses as much as digits as its factorization.
1202110200073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 19.
Adding to 1202110200073 its reverse (3700020112021), we get a palindrome (4902130312094).
The spelling of 1202110200073 in words is "one trillion, two hundred two billion, one hundred ten million, two hundred thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •