Base | Representation |
---|---|
bin | 110010000011001011110000… |
… | …101000101010010101010101 |
3 | 1001212101101001201000110110202 |
4 | 302003023300220222111111 |
5 | 212322431013421022442 |
6 | 2100054124211030245 |
7 | 64236140222652455 |
oct | 6203136050522525 |
9 | 1055341051013422 |
10 | 220121111110997 |
11 | 64156925749658 |
12 | 20830b4289b385 |
13 | 95a94409cb0b5 |
14 | 3c4dcc09b9d65 |
15 | 1a6acc6708c32 |
hex | c832f0a2a555 |
220121111110997 has 2 divisors, whose sum is σ = 220121111110998. Its totient is φ = 220121111110996.
The previous prime is 220121111110987. The next prime is 220121111111021. The reversal of 220121111110997 is 799011111121022.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131113698339121 + 89007412771876 = 11450489^2 + 9434374^2 .
It is a cyclic number.
It is not a de Polignac number, because 220121111110997 - 212 = 220121111106901 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220121111110997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220121111110987) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110060555555498 + 110060555555499.
It is an arithmetic number, because the mean of its divisors is an integer number (110060555555499).
Almost surely, 2220121111110997 is an apocalyptic number.
It is an amenable number.
220121111110997 is a deficient number, since it is larger than the sum of its proper divisors (1).
220121111110997 is an equidigital number, since it uses as much as digits as its factorization.
220121111110997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 38.
The spelling of 220121111110997 in words is "two hundred twenty trillion, one hundred twenty-one billion, one hundred eleven million, one hundred ten thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •