Base | Representation |
---|---|
bin | 1100010101111000001… |
… | …0000111110100100101 |
3 | 202021021210202102111101 |
4 | 3011132002013310211 |
5 | 11433214414342013 |
6 | 241223344240101 |
7 | 21214216603063 |
oct | 3053602076445 |
9 | 667253672441 |
10 | 212031012133 |
11 | 81a15a84736 |
12 | 35114910031 |
13 | 16cc0a21575 |
14 | a395c93033 |
15 | 57ae7bd8dd |
hex | 315e087d25 |
212031012133 has 2 divisors, whose sum is σ = 212031012134. Its totient is φ = 212031012132.
The previous prime is 212031012113. The next prime is 212031012169. The reversal of 212031012133 is 331210130212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 159323117409 + 52707894724 = 399153^2 + 229582^2 .
It is a cyclic number.
It is not a de Polignac number, because 212031012133 - 237 = 74592058661 is a prime.
It is a super-2 number, since 2×2120310121332 (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 212031012133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212031012103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106015506066 + 106015506067.
It is an arithmetic number, because the mean of its divisors is an integer number (106015506067).
Almost surely, 2212031012133 is an apocalyptic number.
It is an amenable number.
212031012133 is a deficient number, since it is larger than the sum of its proper divisors (1).
212031012133 is an equidigital number, since it uses as much as digits as its factorization.
212031012133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 212031012133 its reverse (331210130212), we get a palindrome (543241142345).
The spelling of 212031012133 in words is "two hundred twelve billion, thirty-one million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •