Base | Representation |
---|---|
bin | 110010000001101111101001… |
… | …101110101011011111110111 |
3 | 1001212000220210012000021201022 |
4 | 302001233221232223133313 |
5 | 212314320442004002221 |
6 | 2055540450334251355 |
7 | 64226036332616366 |
oct | 6201575156533767 |
9 | 1055026705007638 |
10 | 220022211000311 |
11 | 64118994162695 |
12 | 20815941356b5b |
13 | 95a000c030b45 |
14 | 3c491bba697dd |
15 | 1a68438d324ab |
hex | c81be9bab7f7 |
220022211000311 has 2 divisors, whose sum is σ = 220022211000312. Its totient is φ = 220022211000310.
The previous prime is 220022211000283. The next prime is 220022211000313. The reversal of 220022211000311 is 113000112220022.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 220022211000311 - 26 = 220022211000247 is a prime.
Together with 220022211000313, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220022211000311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220022211000313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110011105500155 + 110011105500156.
It is an arithmetic number, because the mean of its divisors is an integer number (110011105500156).
Almost surely, 2220022211000311 is an apocalyptic number.
220022211000311 is a deficient number, since it is larger than the sum of its proper divisors (1).
220022211000311 is an equidigital number, since it uses as much as digits as its factorization.
220022211000311 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 220022211000311 its reverse (113000112220022), we get a palindrome (333022323220333).
The spelling of 220022211000311 in words is "two hundred twenty trillion, twenty-two billion, two hundred eleven million, three hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •