Base | Representation |
---|---|
bin | 1001001001000011000111… |
… | …10010110001110111100001 |
3 | 2122011202002101112000210221 |
4 | 10210201203302301313201 |
5 | 10113323121011413441 |
6 | 110430441553523041 |
7 | 4143221205635131 |
oct | 444414362616741 |
9 | 78152071460727 |
10 | 20102121201121 |
11 | 64502973a1a13 |
12 | 2307b13873481 |
13 | b2a8113c536b |
14 | 4d6d3acc6ac1 |
15 | 24cd804248d1 |
hex | 124863cb1de1 |
20102121201121 has 8 divisors (see below), whose sum is σ = 21425556530304. Its totient is φ = 18794347828800.
The previous prime is 20102121201103. The next prime is 20102121201179. The reversal of 20102121201121 is 12110212120102.
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 20102121201121 - 211 = 20102121199073 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20102121201095 and 20102121201104.
It is not an unprimeable number, because it can be changed into a prime (20102121201181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3915486565 + ... + 3915491698.
It is an arithmetic number, because the mean of its divisors is an integer number (2678194566288).
Almost surely, 220102121201121 is an apocalyptic number.
It is an amenable number.
20102121201121 is a deficient number, since it is larger than the sum of its proper divisors (1323435329183).
20102121201121 is a wasteful number, since it uses less digits than its factorization.
20102121201121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7830978431.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20102121201121 its reverse (12110212120102), we get a palindrome (32212333321223).
The spelling of 20102121201121 in words is "twenty trillion, one hundred two billion, one hundred twenty-one million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •