Base | Representation |
---|---|
bin | 1001001011111101001100… |
… | …10110000101100111100001 |
3 | 2122112021221122111111020120 |
4 | 10211332212112011213201 |
5 | 10121442220113013441 |
6 | 110544403014430453 |
7 | 4153355636502612 |
oct | 445764626054741 |
9 | 78467848444216 |
10 | 20202022001121 |
11 | 64896a1832644 |
12 | 2323354362429 |
13 | b370724b147c |
14 | 4dbad6ac3c09 |
15 | 25077aab6966 |
hex | 125fa65859e1 |
20202022001121 has 16 divisors (see below), whose sum is σ = 27509663750400. Its totient is φ = 13181208447488.
The previous prime is 20202022001101. The next prime is 20202022001167. The reversal of 20202022001121 is 12110022020202.
It is a cyclic number.
It is not a de Polignac number, because 20202022001121 - 217 = 20202021870049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20202022001121.
It is not an unprimeable number, because it can be changed into a prime (20202022001101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6152785 + ... + 8846513.
It is an arithmetic number, because the mean of its divisors is an integer number (1719353984400).
Almost surely, 220202022001121 is an apocalyptic number.
It is an amenable number.
20202022001121 is a deficient number, since it is larger than the sum of its proper divisors (7307641749279).
20202022001121 is a wasteful number, since it uses less digits than its factorization.
20202022001121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2746968.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20202022001121 its reverse (12110022020202), we get a palindrome (32312044021323).
The spelling of 20202022001121 in words is "twenty trillion, two hundred two billion, twenty-two million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •