Base | Representation |
---|---|
bin | 1001000110101110010001… |
… | …10001100011011110010011 |
3 | 2121220002211022101020000012 |
4 | 10203113020301203132103 |
5 | 10111020442004001321 |
6 | 110330024324545135 |
7 | 4134362024301350 |
oct | 443271061433623 |
9 | 77802738336005 |
10 | 20022211000211 |
11 | 641a41014a262 |
12 | 22b4531b521ab |
13 | b23117a71c04 |
14 | 4d311a045627 |
15 | 24ac54c9305b |
hex | 1235c8c63793 |
20022211000211 has 8 divisors (see below), whose sum is σ = 22960624221024. Its totient is φ = 17103322120320.
The previous prime is 20022211000199. The next prime is 20022211000223. The reversal of 20022211000211 is 11200011222002.
It is an interprime number because it is at equal distance from previous prime (20022211000199) and next prime (20022211000223).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20022211000211 - 222 = 20022206805907 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20022211008211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4881083030 + ... + 4881087131.
It is an arithmetic number, because the mean of its divisors is an integer number (2870078027628).
Almost surely, 220022211000211 is an apocalyptic number.
20022211000211 is a deficient number, since it is larger than the sum of its proper divisors (2938413220813).
20022211000211 is an equidigital number, since it uses as much as digits as its factorization.
20022211000211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9762170461.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20022211000211 its reverse (11200011222002), we get a palindrome (31222222222213).
The spelling of 20022211000211 in words is "twenty trillion, twenty-two billion, two hundred eleven million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •