Base | Representation |
---|---|
bin | 1100010101110101110… |
… | …0010110110101000101 |
3 | 202021021010010110020201 |
4 | 3011131130112311011 |
5 | 11433204401042013 |
6 | 241222352130501 |
7 | 21214036501105 |
oct | 3053534266505 |
9 | 667233113221 |
10 | 212021112133 |
11 | 81a10432716 |
12 | 35111536a31 |
13 | 16cbb96638c |
14 | a394837205 |
15 | 57ad9b53dd |
hex | 315d716d45 |
212021112133 has 2 divisors, whose sum is σ = 212021112134. Its totient is φ = 212021112132.
The previous prime is 212021112109. The next prime is 212021112139. The reversal of 212021112133 is 331211120212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 196822660609 + 15198451524 = 443647^2 + 123282^2 .
It is a cyclic number.
It is not a de Polignac number, because 212021112133 - 233 = 203431177541 is a prime.
It is a super-2 number, since 2×2120211121332 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 212021112133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212021112139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106010556066 + 106010556067.
It is an arithmetic number, because the mean of its divisors is an integer number (106010556067).
Almost surely, 2212021112133 is an apocalyptic number.
It is an amenable number.
212021112133 is a deficient number, since it is larger than the sum of its proper divisors (1).
212021112133 is an equidigital number, since it uses as much as digits as its factorization.
212021112133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 212021112133 its reverse (331211120212), we get a palindrome (543232232345).
The spelling of 212021112133 in words is "two hundred twelve billion, twenty-one million, one hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •