Base | Representation |
---|---|
bin | 11001000000101110011011… |
… | …110110100110100100001001 |
3 | 112102110222212100222221000001 |
4 | 121000232123312212210021 |
5 | 103404224043140400243 |
6 | 1025541434425043001 |
7 | 32112211606211644 |
oct | 3100563366464411 |
9 | 472428770887001 |
10 | 110001022200073 |
11 | 32060198347244 |
12 | 10406b27926461 |
13 | 494c089cb2284 |
14 | 1d241139caa5b |
15 | cab5a432ba4d |
hex | 640b9bda6909 |
110001022200073 has 2 divisors, whose sum is σ = 110001022200074. Its totient is φ = 110001022200072.
The previous prime is 110001022200061. The next prime is 110001022200227. The reversal of 110001022200073 is 370002220100011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 60162547628304 + 49838474571769 = 7756452^2 + 7059637^2 .
It is a cyclic number.
It is not a de Polignac number, because 110001022200073 - 233 = 109992432265481 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110001022200073.
It is not a weakly prime, because it can be changed into another prime (110001022203073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000511100036 + 55000511100037.
It is an arithmetic number, because the mean of its divisors is an integer number (55000511100037).
Almost surely, 2110001022200073 is an apocalyptic number.
It is an amenable number.
110001022200073 is a deficient number, since it is larger than the sum of its proper divisors (1).
110001022200073 is an equidigital number, since it uses as much as digits as its factorization.
110001022200073 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 110001022200073 its reverse (370002220100011), we get a palindrome (480003242300084).
The spelling of 110001022200073 in words is "one hundred ten trillion, one billion, twenty-two million, two hundred thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •