Base | Representation |
---|---|
bin | 1100010101110011010… |
… | …1111001111000110001 |
3 | 202021020102011100001122 |
4 | 3011130311321320301 |
5 | 11433144311011423 |
6 | 241221352112025 |
7 | 21213555016226 |
oct | 3053465717061 |
9 | 667212140048 |
10 | 212011032113 |
11 | 81a05778421 |
12 | 3510a095615 |
13 | 16cb984727a |
14 | a39337194d |
15 | 57acb738c8 |
hex | 315cd79e31 |
212011032113 has 2 divisors, whose sum is σ = 212011032114. Its totient is φ = 212011032112.
The previous prime is 212011032097. The next prime is 212011032193. The reversal of 212011032113 is 311230110212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 148674249889 + 63336782224 = 385583^2 + 251668^2 .
It is a cyclic number.
It is not a de Polignac number, because 212011032113 - 24 = 212011032097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212011032091 and 212011032100.
It is not a weakly prime, because it can be changed into another prime (212011032193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106005516056 + 106005516057.
It is an arithmetic number, because the mean of its divisors is an integer number (106005516057).
Almost surely, 2212011032113 is an apocalyptic number.
It is an amenable number.
212011032113 is a deficient number, since it is larger than the sum of its proper divisors (1).
212011032113 is an equidigital number, since it uses as much as digits as its factorization.
212011032113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 212011032113 its reverse (311230110212), we get a palindrome (523241142325).
The spelling of 212011032113 in words is "two hundred twelve billion, eleven million, thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •