Base | Representation |
---|---|
bin | 11001000000101101101010… |
… | …111010101111100110010111 |
3 | 112102110220202011010220110122 |
4 | 121000231222322233212113 |
5 | 103404220403001431241 |
6 | 1025541221140142155 |
7 | 32112152346641525 |
oct | 3100555272574627 |
9 | 472426664126418 |
10 | 110000201202071 |
11 | 3205a9069742a4 |
12 | 1040693899795b |
13 | 494bc88b8993b |
14 | 1d24076957315 |
15 | cab55720804b |
hex | 640b6aeaf997 |
110000201202071 has 2 divisors, whose sum is σ = 110000201202072. Its totient is φ = 110000201202070.
The previous prime is 110000201202007. The next prime is 110000201202137. The reversal of 110000201202071 is 170202102000011.
It is a weak prime.
It is an emirp because it is prime and its reverse (170202102000011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110000201202071 - 26 = 110000201202007 is a prime.
It is a super-2 number, since 2×1100002012020712 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110000207202071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000100601035 + 55000100601036.
It is an arithmetic number, because the mean of its divisors is an integer number (55000100601036).
Almost surely, 2110000201202071 is an apocalyptic number.
110000201202071 is a deficient number, since it is larger than the sum of its proper divisors (1).
110000201202071 is an equidigital number, since it uses as much as digits as its factorization.
110000201202071 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 17.
Adding to 110000201202071 its reverse (170202102000011), we get a palindrome (280202303202082).
The spelling of 110000201202071 in words is "one hundred ten trillion, two hundred one million, two hundred two thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •