Base | Representation |
---|---|
bin | 100000010011100011101… |
… | …100111000110111010101 |
3 | 21212020021020112120202201 |
4 | 200103203230320313111 |
5 | 242333101432220041 |
6 | 4415510432204501 |
7 | 316251150603253 |
oct | 40234354706725 |
9 | 7766236476681 |
10 | 2220023320021 |
11 | 786563319751 |
12 | 2ba309399731 |
13 | 1314690347b0 |
14 | 79641da75d3 |
15 | 3cb34277631 |
hex | 204e3b38dd5 |
2220023320021 has 8 divisors (see below), whose sum is σ = 2390809589504. Its totient is φ = 2049239228400.
The previous prime is 2220023319991. The next prime is 2220023320043. The reversal of 2220023320021 is 1200233200222.
2220023320021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2220023320021 - 217 = 2220023188949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2220023320321) 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, 2020096 + ... + 2919046.
It is an arithmetic number, because the mean of its divisors is an integer number (298851198688).
Almost surely, 22220023320021 is an apocalyptic number.
It is an amenable number.
2220023320021 is a deficient number, since it is larger than the sum of its proper divisors (170786269483).
2220023320021 is a wasteful number, since it uses less digits than its factorization.
2220023320021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1088931.
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 2220023320021 its reverse (1200233200222), we get a palindrome (3420256520243).
The spelling of 2220023320021 in words is "two trillion, two hundred twenty billion, twenty-three million, three hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •