Base | Representation |
---|---|
bin | 11101011001100011010… |
… | …101000101110010001101 |
3 | 21011010202020221200210221 |
4 | 131121203111011302031 |
5 | 231100034040232341 |
6 | 4144040304031341 |
7 | 265650642012013 |
oct | 35314325056215 |
9 | 7133666850727 |
10 | 2020301102221 |
11 | 709894337416 |
12 | 28766a902551 |
13 | 11868a4346ac |
14 | 6dad6b548b3 |
15 | 378453c3ed1 |
hex | 1d663545c8d |
2020301102221 has 16 divisors (see below), whose sum is σ = 2200466520000. Its totient is φ = 1847549160576.
The previous prime is 2020301102203. The next prime is 2020301102293. The reversal of 2020301102221 is 1222011030202.
It is a happy number.
It is not a de Polignac number, because 2020301102221 - 227 = 2020166884493 is a prime.
It is a super-2 number, since 2×20203011022212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2020301102195 and 2020301102204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020301102201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2013550 + ... + 2845168.
It is an arithmetic number, because the mean of its divisors is an integer number (137529157500).
Almost surely, 22020301102221 is an apocalyptic number.
It is an amenable number.
2020301102221 is a deficient number, since it is larger than the sum of its proper divisors (180165417779).
2020301102221 is a wasteful number, since it uses less digits than its factorization.
2020301102221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 836076.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 2020301102221 its reverse (1222011030202), we get a palindrome (3242312132423).
The spelling of 2020301102221 in words is "two trillion, twenty billion, three hundred one million, one hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •