Base | Representation |
---|---|
bin | 1100010101111000011… |
… | …0110001011110001111 |
3 | 202021021220001100220010 |
4 | 3011132012301132033 |
5 | 11433220222400221 |
6 | 241223430324303 |
7 | 21214233141405 |
oct | 3053606613617 |
9 | 667256040803 |
10 | 212032231311 |
11 | 81a1673771a |
12 | 351151b9693 |
13 | 16cc105a484 |
14 | a3960cd475 |
15 | 57ae95ec76 |
hex | 315e1b178f |
212032231311 has 8 divisors (see below), whose sum is σ = 283955059584. Its totient is φ = 140732111960.
The previous prime is 212032231303. The next prime is 212032231319. The reversal of 212032231311 is 113132230212.
It is an interprime number because it is at equal distance from previous prime (212032231303) and next prime (212032231319).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 212032231311 - 23 = 212032231303 is a prime.
It is a super-2 number, since 2×2120322313112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212032231319) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 155676435 + ... + 155677796.
It is an arithmetic number, because the mean of its divisors is an integer number (35494382448).
Almost surely, 2212032231311 is an apocalyptic number.
212032231311 is a deficient number, since it is larger than the sum of its proper divisors (71922828273).
212032231311 is a wasteful number, since it uses less digits than its factorization.
212032231311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311354461.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 212032231311 its reverse (113132230212), we get a palindrome (325164461523).
The spelling of 212032231311 in words is "two hundred twelve billion, thirty-two million, two hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •