Base | Representation |
---|---|
bin | 11101011001011110011… |
… | …111101111111000110001 |
3 | 21011010112121100210020120 |
4 | 131121132133233320301 |
5 | 231044402310310113 |
6 | 4144024250000453 |
7 | 265645635516441 |
oct | 35313637577061 |
9 | 7133477323216 |
10 | 2020220010033 |
11 | 70985258a685 |
12 | 287647716129 |
13 | 1186766b1154 |
14 | 6daca086121 |
15 | 3783d206a23 |
hex | 1d65e7efe31 |
2020220010033 has 8 divisors (see below), whose sum is σ = 2696160669888. Its totient is φ = 1345546345104.
The previous prime is 2020220009981. The next prime is 2020220010041. The reversal of 2020220010033 is 3300100220202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-2020220010033 is a prime.
It is a super-2 number, since 2×20202200100332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2020220009994 and 2020220010021.
It is not an unprimeable number, because it can be changed into a prime (2020220010233) 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, 316745010 + ... + 316751387.
It is an arithmetic number, because the mean of its divisors is an integer number (337020083736).
Almost surely, 22020220010033 is an apocalyptic number.
It is an amenable number.
2020220010033 is a deficient number, since it is larger than the sum of its proper divisors (675940659855).
2020220010033 is a wasteful number, since it uses less digits than its factorization.
2020220010033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 633497463.
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 2020220010033 its reverse (3300100220202), we get a palindrome (5320320230235).
The spelling of 2020220010033 in words is "two trillion, twenty billion, two hundred twenty million, ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •