Base | Representation |
---|---|
bin | 1100010101111000011… |
… | …0010001101110111111 |
3 | 202021021212210202120022 |
4 | 3011132012101232333 |
5 | 11433220204220221 |
6 | 241223423442355 |
7 | 21214232060402 |
oct | 3053606215677 |
9 | 667255722508 |
10 | 212032101311 |
11 | 81a16658a88 |
12 | 351151563bb |
13 | 16cc1013254 |
14 | a396097d39 |
15 | 57ae9364ab |
hex | 315e191bbf |
212032101311 has 4 divisors (see below), whose sum is σ = 215625865800. Its totient is φ = 208438336824.
The previous prime is 212032101289. The next prime is 212032101317. The reversal of 212032101311 is 113101230212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 212032101311 - 230 = 210958359487 is a prime.
It is a super-2 number, since 2×2120321013112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 212032101311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212032101317) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1796882156 + ... + 1796882273.
It is an arithmetic number, because the mean of its divisors is an integer number (53906466450).
Almost surely, 2212032101311 is an apocalyptic number.
212032101311 is a deficient number, since it is larger than the sum of its proper divisors (3593764489).
212032101311 is an equidigital number, since it uses as much as digits as its factorization.
212032101311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3593764488.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 212032101311 its reverse (113101230212), we get a palindrome (325133331523).
The spelling of 212032101311 in words is "two hundred twelve billion, thirty-two million, one hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •