Base | Representation |
---|---|
bin | 11101011001010001100… |
… | …000110111111000100001 |
3 | 21011002222102111221120211 |
4 | 131121101200313320201 |
5 | 231043431030413441 |
6 | 4143550505334121 |
7 | 265640352260152 |
oct | 35312140677041 |
9 | 7132872457524 |
10 | 2020002201121 |
11 | 709750643613 |
12 | 2875a6797341 |
13 | 11864052cb38 |
14 | 6daa9189929 |
15 | 37829030a81 |
hex | 1d651837e21 |
2020002201121 has 4 divisors (see below), whose sum is σ = 2020108485700. Its totient is φ = 2019895916544.
The previous prime is 2020002201109. The next prime is 2020002201143. The reversal of 2020002201121 is 1211022000202.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1445498839521 + 574503361600 = 1202289^2 + 757960^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2020002201121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2020002201101) 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, 53113776 + ... + 53151793.
It is an arithmetic number, because the mean of its divisors is an integer number (505027121425).
Almost surely, 22020002201121 is an apocalyptic number.
It is an amenable number.
2020002201121 is a deficient number, since it is larger than the sum of its proper divisors (106284579).
2020002201121 is a wasteful number, since it uses less digits than its factorization.
2020002201121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106284578.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2020002201121 its reverse (1211022000202), we get a palindrome (3231024201323).
The spelling of 2020002201121 in words is "two trillion, twenty billion, two million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •