Base | Representation |
---|---|
bin | 1100011001111100010… |
… | …0110010101101001001 |
3 | 202101002212002002112011 |
4 | 3012133010302231021 |
5 | 11442433242343423 |
6 | 241523525015521 |
7 | 21253240034401 |
oct | 3063704625511 |
9 | 671085062464 |
10 | 213122231113 |
11 | 82425a41700 |
12 | 3537a2545a1 |
13 | 17135b1947c |
14 | a45ab87801 |
15 | 58254bcb0d |
hex | 319f132b49 |
213122231113 has 12 divisors (see below), whose sum is σ = 234316293120. Its totient is φ = 193699535480.
The previous prime is 213122231107. The next prime is 213122231123. The reversal of 213122231113 is 311132221312.
213122231113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 213122231113 - 213 = 213122222921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213122231123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 277656 + ... + 709462.
It is an arithmetic number, because the mean of its divisors is an integer number (19526357760).
Almost surely, 2213122231113 is an apocalyptic number.
It is an amenable number.
213122231113 is a deficient number, since it is larger than the sum of its proper divisors (21194062007).
213122231113 is a wasteful number, since it uses less digits than its factorization.
213122231113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435908 (or 435897 counting only the distinct ones).
The product of its digits is 432, while the sum is 22.
Adding to 213122231113 its reverse (311132221312), we get a palindrome (524254452425).
The spelling of 213122231113 in words is "two hundred thirteen billion, one hundred twenty-two million, two hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •