Base | Representation |
---|---|
bin | 110000001101010011000111… |
… | …111111111010111000111011 |
3 | 1000210200220222202221222121022 |
4 | 300031103013333322320323 |
5 | 210242214201440201021 |
6 | 2030532410550533055 |
7 | 62441643151233011 |
oct | 6015230777727073 |
9 | 1023626882858538 |
10 | 212020121022011 |
11 | 61613256a66865 |
12 | 1b942b0566718b |
13 | 913c54744a543 |
14 | 3a4db859cc8b1 |
15 | 197a1e36841ab |
hex | c0d4c7ffae3b |
212020121022011 has 4 divisors (see below), whose sum is σ = 212078512686624. Its totient is φ = 211961729357400.
The previous prime is 212020121022007. The next prime is 212020121022023. The reversal of 212020121022011 is 110220121020212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 212020121022011 - 22 = 212020121022007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212020121022071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29195826860 + ... + 29195834121.
It is an arithmetic number, because the mean of its divisors is an integer number (53019628171656).
Almost surely, 2212020121022011 is an apocalyptic number.
212020121022011 is a deficient number, since it is larger than the sum of its proper divisors (58391664613).
212020121022011 is an equidigital number, since it uses as much as digits as its factorization.
212020121022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58391664612.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 212020121022011 its reverse (110220121020212), we get a palindrome (322240242042223).
The spelling of 212020121022011 in words is "two hundred twelve trillion, twenty billion, one hundred twenty-one million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •