Base | Representation |
---|---|
bin | 1100110100011001000… |
… | …1011100101010100111 |
3 | 210001102200010112012211 |
4 | 3031012101130222213 |
5 | 12102003402423304 |
6 | 245100240224251 |
7 | 21624212521111 |
oct | 3150621345247 |
9 | 701380115184 |
10 | 220222311079 |
11 | 85439831891 |
12 | 3682000b087 |
13 | 179c7a93414 |
14 | a931b163b1 |
15 | 5add9a5204 |
hex | 334645caa7 |
220222311079 has 2 divisors, whose sum is σ = 220222311080. Its totient is φ = 220222311078.
The previous prime is 220222310981. The next prime is 220222311083. The reversal of 220222311079 is 970113222022.
220222311079 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 is a cyclic number.
It is not a de Polignac number, because 220222311079 - 225 = 220188756647 is a prime.
It is a super-2 number, since 2×2202223110792 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 220222311079.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220222311679) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110111155539 + 110111155540.
It is an arithmetic number, because the mean of its divisors is an integer number (110111155540).
Almost surely, 2220222311079 is an apocalyptic number.
220222311079 is a deficient number, since it is larger than the sum of its proper divisors (1).
220222311079 is an equidigital number, since it uses as much as digits as its factorization.
220222311079 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 31.
The spelling of 220222311079 in words is "two hundred twenty billion, two hundred twenty-two million, three hundred eleven thousand, seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •