Base | Representation |
---|---|
bin | 101101111110101100000100… |
… | …011110000111101000011011 |
3 | 222112000001012220022020020021 |
4 | 231332230010132013220123 |
5 | 203001133100132431021 |
6 | 1554030332251011311 |
7 | 60410625420553510 |
oct | 5576540436075033 |
9 | 875001186266207 |
10 | 202220020202011 |
11 | 594850355a2429 |
12 | 1a81b717739b37 |
13 | 88ab35c7713a6 |
14 | 37d1703419307 |
15 | 185a317decc41 |
hex | b7eb04787a1b |
202220020202011 has 4 divisors (see below), whose sum is σ = 231108594516592. Its totient is φ = 173331445887432.
The previous prime is 202220020201963. The next prime is 202220020202023. The reversal of 202220020202011 is 110202020022202.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 202220020202011 - 231 = 202217872718363 is a prime.
It is a super-2 number, since 2×2022200202020112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202220020202041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14444287157280 + ... + 14444287157293.
It is an arithmetic number, because the mean of its divisors is an integer number (57777148629148).
Almost surely, 2202220020202011 is an apocalyptic number.
202220020202011 is a deficient number, since it is larger than the sum of its proper divisors (28888574314581).
202220020202011 is an equidigital number, since it uses as much as digits as its factorization.
202220020202011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28888574314580.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 202220020202011 its reverse (110202020022202), we get a palindrome (312422040224213).
The spelling of 202220020202011 in words is "two hundred two trillion, two hundred twenty billion, twenty million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •