Base | Representation |
---|---|
bin | 110010000011000001100001… |
… | …100101111100011010100101 |
3 | 1001212100022200210210100022011 |
4 | 302003001201211330122211 |
5 | 212322241012024302044 |
6 | 2100045105505434221 |
7 | 64235300666205652 |
oct | 6203014145743245 |
9 | 1055308623710264 |
10 | 220110121322149 |
11 | 641521a6255633 |
12 | 2082a99633b971 |
13 | 95a83abc3a466 |
14 | 3c4d55b206c29 |
15 | 1a6a8819d5134 |
hex | c8306197c6a5 |
220110121322149 has 2 divisors, whose sum is σ = 220110121322150. Its totient is φ = 220110121322148.
The previous prime is 220110121322111. The next prime is 220110121322197. The reversal of 220110121322149 is 941223121011022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111061036102500 + 109049085219649 = 10538550^2 + 10442657^2 .
It is a cyclic number.
It is not a de Polignac number, because 220110121322149 - 245 = 184925749233317 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220110121322149.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220110121322549) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110055060661074 + 110055060661075.
It is an arithmetic number, because the mean of its divisors is an integer number (110055060661075).
Almost surely, 2220110121322149 is an apocalyptic number.
It is an amenable number.
220110121322149 is a deficient number, since it is larger than the sum of its proper divisors (1).
220110121322149 is an equidigital number, since it uses as much as digits as its factorization.
220110121322149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 31.
The spelling of 220110121322149 in words is "two hundred twenty trillion, one hundred ten billion, one hundred twenty-one million, three hundred twenty-two thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •