Base | Representation |
---|---|
bin | 1001000110101010001100… |
… | …01111110101000001100001 |
3 | 2121212220011200201211122020 |
4 | 10203111012033311001201 |
5 | 10111002000401333441 |
6 | 110325023140132053 |
7 | 4134253533524250 |
oct | 443250617650141 |
9 | 77786150654566 |
10 | 20020021121121 |
11 | 641949700272a |
12 | 22b4020697029 |
13 | b22b59175178 |
14 | 4d2d8d280797 |
15 | 24ab778c4e66 |
hex | 1235463f5061 |
20020021121121 has 64 divisors (see below), whose sum is σ = 30792564092928. Its totient is φ = 11333297979648.
The previous prime is 20020021121119. The next prime is 20020021121147. The reversal of 20020021121121 is 12112112002002.
It is not a de Polignac number, because 20020021121121 - 21 = 20020021121119 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20020021121121.
It is not an unprimeable number, because it can be changed into a prime (20020021121161) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3622219260 + ... + 3622224786.
It is an arithmetic number, because the mean of its divisors is an integer number (481133813952).
Almost surely, 220020021121121 is an apocalyptic number.
20020021121121 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20020021121121 is a deficient number, since it is larger than the sum of its proper divisors (10772542971807).
20020021121121 is a wasteful number, since it uses less digits than its factorization.
20020021121121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8910.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20020021121121 its reverse (12112112002002), we get a palindrome (32132133123123).
The spelling of 20020021121121 in words is "twenty trillion, twenty billion, twenty-one million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •