Base | Representation |
---|---|
bin | 11011100000111100011101… |
… | …101101011101001010110101 |
3 | 120212110120001201210001000220 |
4 | 123200330131231131022311 |
5 | 111330121420204120041 |
6 | 1105211440113324553 |
7 | 34326525252425535 |
oct | 3340743555351265 |
9 | 525416051701026 |
10 | 121011202020021 |
11 | 3561562086a595 |
12 | 116a4946866759 |
13 | 526a3cc433711 |
14 | 21c4d8b1334c5 |
15 | decba4563d66 |
hex | 6e0f1db5d2b5 |
121011202020021 has 8 divisors (see below), whose sum is σ = 161547710981760. Its totient is φ = 80574413869152.
The previous prime is 121011202020019. The next prime is 121011202020089. The reversal of 121011202020021 is 120020202110121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121011202020021 - 21 = 121011202020019 is a prime.
It is a super-2 number, since 2×1210112020200212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121011202020011) 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, 24930199885 + ... + 24930204738.
It is an arithmetic number, because the mean of its divisors is an integer number (20193463872720).
Almost surely, 2121011202020021 is an apocalyptic number.
It is an amenable number.
121011202020021 is a deficient number, since it is larger than the sum of its proper divisors (40536508961739).
121011202020021 is an equidigital number, since it uses as much as digits as its factorization.
121011202020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49860405435.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 121011202020021 its reverse (120020202110121), we get a palindrome (241031404130142).
The spelling of 121011202020021 in words is "one hundred twenty-one trillion, eleven billion, two hundred two million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •