Base | Representation |
---|---|
bin | 10010110101001101… |
… | …010000010110011001 |
3 | 1221012011112110010010 |
4 | 102311031100112121 |
5 | 312402311120441 |
6 | 13142225112133 |
7 | 1314033222660 |
oct | 226515202631 |
9 | 57164473103 |
10 | 20220020121 |
11 | 8636746434 |
12 | 3b03788649 |
13 | 1ba3151562 |
14 | d9b5d9dd7 |
15 | 7d522c116 |
hex | 4b5350599 |
20220020121 has 16 divisors (see below), whose sum is σ = 31233536384. Its totient is φ = 11396018304.
The previous prime is 20220020113. The next prime is 20220020129. The reversal of 20220020121 is 12102002202.
It is an interprime number because it is at equal distance from previous prime (20220020113) and next prime (20220020129).
It is not a de Polignac number, because 20220020121 - 23 = 20220020113 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20220020097 and 20220020106.
It is not an unprimeable number, because it can be changed into a prime (20220020129) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6593386 + ... + 6596451.
It is an arithmetic number, because the mean of its divisors is an integer number (1952096024).
Almost surely, 220220020121 is an apocalyptic number.
20220020121 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20220020121 is a deficient number, since it is larger than the sum of its proper divisors (11013516263).
20220020121 is a wasteful number, since it uses less digits than its factorization.
20220020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13189920.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 20220020121 its reverse (12102002202), we get a palindrome (32322022323).
The spelling of 20220020121 in words is "twenty billion, two hundred twenty million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •