Base | Representation |
---|---|
bin | 1100010101110101100… |
… | …1010000110011010011 |
3 | 202021021001121020121011 |
4 | 3011131121100303103 |
5 | 11433204144113021 |
6 | 241222322511351 |
7 | 21214026552241 |
oct | 3053531206323 |
9 | 667231536534 |
10 | 212020301011 |
11 | 81a0aa29272 |
12 | 35111205557 |
13 | 16cbb74111c |
14 | a3946a5791 |
15 | 57ad8a4de1 |
hex | 315d650cd3 |
212020301011 has 16 divisors (see below), whose sum is σ = 222601446144. Its totient is φ = 201556564704.
The previous prime is 212020300993. The next prime is 212020301023. The reversal of 212020301011 is 110103020212.
212020301011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 212020301011 - 213 = 212020292819 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212020300982 and 212020301000.
It is not an unprimeable number, because it can be changed into a prime (212020301071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2406901 + ... + 2493433.
It is an arithmetic number, because the mean of its divisors is an integer number (13912590384).
Almost surely, 2212020301011 is an apocalyptic number.
212020301011 is a deficient number, since it is larger than the sum of its proper divisors (10581145133).
212020301011 is a wasteful number, since it uses less digits than its factorization.
212020301011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87210.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 212020301011 its reverse (110103020212), we get a palindrome (322123321223).
The spelling of 212020301011 in words is "two hundred twelve billion, twenty million, three hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •