Base | Representation |
---|---|
bin | 1100010101110011010… |
… | …1110101010001011101 |
3 | 202021020102010101010122 |
4 | 3011130311311101131 |
5 | 11433144304410323 |
6 | 241221351444325 |
7 | 21213554610146 |
oct | 3053465652135 |
9 | 667212111118 |
10 | 212011013213 |
11 | 81a057651aa |
12 | 3510a0866a5 |
13 | 16cb983b79c |
14 | a393368acd |
15 | 57acb6cec8 |
hex | 315cd7545d |
212011013213 has 4 divisors (see below), whose sum is σ = 212464998720. Its totient is φ = 211557027708.
The previous prime is 212011013143. The next prime is 212011013219. The reversal of 212011013213 is 312310110212.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 212011013213 - 216 = 212010947677 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212011013191 and 212011013200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212011013219) 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, 226992053 + ... + 226992986.
It is an arithmetic number, because the mean of its divisors is an integer number (53116249680).
Almost surely, 2212011013213 is an apocalyptic number.
It is an amenable number.
212011013213 is a deficient number, since it is larger than the sum of its proper divisors (453985507).
212011013213 is an equidigital number, since it uses as much as digits as its factorization.
212011013213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 453985506.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 212011013213 its reverse (312310110212), we get a palindrome (524321123425).
The spelling of 212011013213 in words is "two hundred twelve billion, eleven million, thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •