Base | Representation |
---|---|
bin | 11001000001000010001010… |
… | …001010010101100110101001 |
3 | 112102120000112022011210220011 |
4 | 121001002022022111212221 |
5 | 103410100431224020243 |
6 | 1025555300115331521 |
7 | 32113561454340331 |
oct | 3101021212254651 |
9 | 472500468153804 |
10 | 110022200220073 |
11 | 3206917582a109 |
12 | 1040b0582b0ba1 |
13 | 495108375695b |
14 | 1d251625200c1 |
15 | cabde36e089d |
hex | 64108a2959a9 |
110022200220073 has 2 divisors, whose sum is σ = 110022200220074. Its totient is φ = 110022200220072.
The previous prime is 110022200220061. The next prime is 110022200220083. The reversal of 110022200220073 is 370022002220011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109495128576064 + 527071644009 = 10463992^2 + 725997^2 .
It is an emirp because it is prime and its reverse (370022002220011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110022200220073 - 213 = 110022200211881 is a prime.
It is not a weakly prime, because it can be changed into another prime (110022200220083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55011100110036 + 55011100110037.
It is an arithmetic number, because the mean of its divisors is an integer number (55011100110037).
Almost surely, 2110022200220073 is an apocalyptic number.
It is an amenable number.
110022200220073 is a deficient number, since it is larger than the sum of its proper divisors (1).
110022200220073 is an equidigital number, since it uses as much as digits as its factorization.
110022200220073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 672, while the sum is 22.
Adding to 110022200220073 its reverse (370022002220011), we get a palindrome (480044202440084).
The spelling of 110022200220073 in words is "one hundred ten trillion, twenty-two billion, two hundred million, two hundred twenty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •