Base | Representation |
---|---|
bin | 1100010101110101110… |
… | …0011011001100010001 |
3 | 202021021010011100202111 |
4 | 3011131130123030101 |
5 | 11433204402130001 |
6 | 241222352345321 |
7 | 21214036604152 |
oct | 3053534331421 |
9 | 667233140674 |
10 | 212021130001 |
11 | 81a1044508a |
12 | 35111545241 |
13 | 16cbb971555 |
14 | a39483d929 |
15 | 57ad9ba851 |
hex | 315d71b311 |
212021130001 has 2 divisors, whose sum is σ = 212021130002. Its totient is φ = 212021130000.
The previous prime is 212021129981. The next prime is 212021130037. The reversal of 212021130001 is 100031120212.
212021130001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 211949744400 + 71385601 = 460380^2 + 8449^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212021130001 is a prime.
It is not a weakly prime, because it can be changed into another prime (212021131001) 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 as a sum of consecutive naturals, namely, 106010565000 + 106010565001.
It is an arithmetic number, because the mean of its divisors is an integer number (106010565001).
Almost surely, 2212021130001 is an apocalyptic number.
It is an amenable number.
212021130001 is a deficient number, since it is larger than the sum of its proper divisors (1).
212021130001 is an equidigital number, since it uses as much as digits as its factorization.
212021130001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 212021130001 its reverse (100031120212), we get a palindrome (312052250213).
The spelling of 212021130001 in words is "two hundred twelve billion, twenty-one million, one hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •