Base | Representation |
---|---|
bin | 110010000001100111001011… |
… | …010110001110110001110101 |
3 | 1001212000001022000101122122212 |
4 | 302001213023112032301311 |
5 | 212314143323000341044 |
6 | 2055532343353103205 |
7 | 64225265000030051 |
oct | 6201471326166165 |
9 | 1055001260348585 |
10 | 220013111340149 |
11 | 64115044692296 |
12 | 208140219b7b05 |
13 | 959c1bba2894a |
14 | 3c48997310c61 |
15 | 1a680a501ba9e |
hex | c819cb58ec75 |
220013111340149 has 2 divisors, whose sum is σ = 220013111340150. Its totient is φ = 220013111340148.
The previous prime is 220013111340097. The next prime is 220013111340343. The reversal of 220013111340149 is 941043111310022.
220013111340149 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 208539072937924 + 11474038402225 = 14440882^2 + 3387335^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220013111340149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220013111340349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110006555670074 + 110006555670075.
It is an arithmetic number, because the mean of its divisors is an integer number (110006555670075).
Almost surely, 2220013111340149 is an apocalyptic number.
It is an amenable number.
220013111340149 is a deficient number, since it is larger than the sum of its proper divisors (1).
220013111340149 is an equidigital number, since it uses as much as digits as its factorization.
220013111340149 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 32.
The spelling of 220013111340149 in words is "two hundred twenty trillion, thirteen billion, one hundred eleven million, three hundred forty thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •