Base | Representation |
---|---|
bin | 11001000000101111100010… |
… | …101001101101000010010001 |
3 | 112102111002221011001110121111 |
4 | 121000233202221231002101 |
5 | 103404234011230013131 |
6 | 1025542152335453321 |
7 | 32112253211311351 |
oct | 3100574251550221 |
9 | 472432834043544 |
10 | 110002210001041 |
11 | 32060747880736 |
12 | 104071b9687241 |
13 | 494c2190c4c97 |
14 | 1d241c7662b61 |
15 | cab623757ab1 |
hex | 640be2a6d091 |
110002210001041 has 2 divisors, whose sum is σ = 110002210001042. Its totient is φ = 110002210001040.
The previous prime is 110002210000919. The next prime is 110002210001063. The reversal of 110002210001041 is 140100012200011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 94875392160000 + 15126817841041 = 9740400^2 + 3889321^2 .
It is a cyclic number.
It is not a de Polignac number, because 110002210001041 - 27 = 110002210000913 is a prime.
It is a super-2 number, since 2×1100022100010412 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110002210001941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55001105000520 + 55001105000521.
It is an arithmetic number, because the mean of its divisors is an integer number (55001105000521).
Almost surely, 2110002210001041 is an apocalyptic number.
It is an amenable number.
110002210001041 is a deficient number, since it is larger than the sum of its proper divisors (1).
110002210001041 is an equidigital number, since it uses as much as digits as its factorization.
110002210001041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110002210001041 its reverse (140100012200011), we get a palindrome (250102222201052).
The spelling of 110002210001041 in words is "one hundred ten trillion, two billion, two hundred ten million, one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •