Base | Representation |
---|---|
bin | 110010000010111001000011… |
… | …001011011011001011011101 |
3 | 1001212022110012121011010200101 |
4 | 302002321003023123023131 |
5 | 212322113342401303242 |
6 | 2100041002504501101 |
7 | 64234526325566011 |
oct | 6202710313331335 |
9 | 1055273177133611 |
10 | 220101021119197 |
11 | 64149356444449 |
12 | 2082907677a791 |
13 | 95a758b7a519a |
14 | 3c4cd3678a541 |
15 | 1a6a4ecb139b7 |
hex | c82e432db2dd |
220101021119197 has 2 divisors, whose sum is σ = 220101021119198. Its totient is φ = 220101021119196.
The previous prime is 220101021119191. The next prime is 220101021119201. The reversal of 220101021119197 is 791911120101022.
220101021119197 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 191627153958916 + 28473867160281 = 13842946^2 + 5336091^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220101021119197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220101021119191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110050510559598 + 110050510559599.
It is an arithmetic number, because the mean of its divisors is an integer number (110050510559599).
Almost surely, 2220101021119197 is an apocalyptic number.
It is an amenable number.
220101021119197 is a deficient number, since it is larger than the sum of its proper divisors (1).
220101021119197 is an equidigital number, since it uses as much as digits as its factorization.
220101021119197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 37.
The spelling of 220101021119197 in words is "two hundred twenty trillion, one hundred one billion, twenty-one million, one hundred nineteen thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •