Base | Representation |
---|---|
bin | 1001000110101010100010… |
… | …00001110101001011100001 |
3 | 2121212220122022002111100111 |
4 | 10203111101001311023201 |
5 | 10111002333203013441 |
6 | 110325053121051321 |
7 | 4134261161136220 |
oct | 443252101651341 |
9 | 77786568074314 |
10 | 20020202001121 |
11 | 641957a116533 |
12 | 22b4071186b41 |
13 | b22b8779675a |
14 | 4d2da92c6cb7 |
15 | 24ab88704081 |
hex | 1235510752e1 |
20020202001121 has 8 divisors (see below), whose sum is σ = 22880428862400. Its totient is φ = 17160024640848.
The previous prime is 20020202001083. The next prime is 20020202001161. The reversal of 20020202001121 is 12110020202002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20020202001121 - 27 = 20020202000993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20020202001161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11504506 + ... + 13129891.
It is an arithmetic number, because the mean of its divisors is an integer number (2860053607800).
Almost surely, 220020202001121 is an apocalyptic number.
It is an amenable number.
20020202001121 is a deficient number, since it is larger than the sum of its proper divisors (2860226861279).
20020202001121 is a wasteful number, since it uses less digits than its factorization.
20020202001121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24750503.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20020202001121 its reverse (12110020202002), we get a palindrome (32130222203123).
The spelling of 20020202001121 in words is "twenty trillion, twenty billion, two hundred two million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •