Base | Representation |
---|---|
bin | 1001001001000010111010… |
… | …01010101010010100000001 |
3 | 2122011201210122022111112011 |
4 | 10210201131022222110001 |
5 | 10113322404031133441 |
6 | 110430422542532521 |
7 | 4143215355630160 |
oct | 444413512522401 |
9 | 78151718274464 |
10 | 20102010021121 |
11 | 645023a664816 |
12 | 2307aa2597141 |
13 | b2a7c4368b92 |
14 | 4d6d2a2253d7 |
15 | 24cd757b2581 |
hex | 12485d2aa501 |
20102010021121 has 32 divisors (see below), whose sum is σ = 25273805760000. Its totient is φ = 15589175196672.
The previous prime is 20102010021109. The next prime is 20102010021133. The reversal of 20102010021121 is 12112001020102.
It is an interprime number because it is at equal distance from previous prime (20102010021109) and next prime (20102010021133).
It is not a de Polignac number, because 20102010021121 - 27 = 20102010020993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20102010022121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11928021 + ... + 13508578.
It is an arithmetic number, because the mean of its divisors is an integer number (789806430000).
Almost surely, 220102010021121 is an apocalyptic number.
It is an amenable number.
20102010021121 is a deficient number, since it is larger than the sum of its proper divisors (5171795738879).
20102010021121 is a wasteful number, since it uses less digits than its factorization.
20102010021121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25436881.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20102010021121 its reverse (12112001020102), we get a palindrome (32214011041223).
The spelling of 20102010021121 in words is "twenty trillion, one hundred two billion, ten million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •