Base | Representation |
---|---|
bin | 11011100000111100010001… |
… | …101110101100111001110100 |
3 | 120212110112112201120011212102 |
4 | 123200330101232230321310 |
5 | 111330121012230120040 |
6 | 1105211404133241232 |
7 | 34326520262104646 |
oct | 3340742156547164 |
9 | 525415481504772 |
10 | 121011001020020 |
11 | 35615528364291 |
12 | 116a48ab493218 |
13 | 526a3998b91c7 |
14 | 21c4d6c570896 |
15 | decb91aad515 |
hex | 6e0f11bace74 |
121011001020020 has 48 divisors (see below), whose sum is σ = 258919410556800. Its totient is φ = 47490828667776.
The previous prime is 121011001020001. The next prime is 121011001020043. The reversal of 121011001020020 is 20020100110121.
It is a junction number, because it is equal to n+sod(n) for n = 121011001019983 and 121011001020010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 351110699 + ... + 351455181.
It is an arithmetic number, because the mean of its divisors is an integer number (5394154386600).
Almost surely, 2121011001020020 is an apocalyptic number.
121011001020020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121011001020020 is an abundant number, since it is smaller than the sum of its proper divisors (137908409536780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121011001020020 is a wasteful number, since it uses less digits than its factorization.
121011001020020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 675944 (or 675942 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 121011001020020 its reverse (20020100110121), we get a palindrome (141031101130141).
The spelling of 121011001020020 in words is "one hundred twenty-one trillion, eleven billion, one million, twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •