Base | Representation |
---|---|
bin | 1001001100010000001010… |
… | …00011111011011110110001 |
3 | 2122120021020001002202220221 |
4 | 10212020011003323132301 |
5 | 10122124041424323441 |
6 | 110553205034133041 |
7 | 4154166116610610 |
oct | 446100503733661 |
9 | 78507201082827 |
10 | 20212201011121 |
11 | 6492a455a34a9 |
12 | 2325315281181 |
13 | b380052b7002 |
14 | 4dc3c0923877 |
15 | 250b745348d1 |
hex | 1262050fb7b1 |
20212201011121 has 8 divisors (see below), whose sum is σ = 23101571727104. Its totient is φ = 17323308652320.
The previous prime is 20212201011077. The next prime is 20212201011193. The reversal of 20212201011121 is 12111010221202.
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 20212201011121 - 211 = 20212201009073 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20212201011095 and 20212201011104.
It is not an unprimeable number, because it can be changed into a prime (20212201015121) 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, 119498745 + ... + 119667766.
It is an arithmetic number, because the mean of its divisors is an integer number (2887696465888).
Almost surely, 220212201011121 is an apocalyptic number.
It is an amenable number.
20212201011121 is a deficient number, since it is larger than the sum of its proper divisors (2889370715983).
20212201011121 is a wasteful number, since it uses less digits than its factorization.
20212201011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239178591.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20212201011121 its reverse (12111010221202), we get a palindrome (32323211232323).
The spelling of 20212201011121 in words is "twenty trillion, two hundred twelve billion, two hundred one million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •