Base | Representation |
---|---|
bin | 1100011010101001010… |
… | …0111100000011111001 |
3 | 202101121000022012202002 |
4 | 3012222110330003321 |
5 | 11443330104404423 |
6 | 241554351150345 |
7 | 21261021460262 |
oct | 3065224740371 |
9 | 671530265662 |
10 | 213311013113 |
11 | 82512562390 |
12 | 354115153b5 |
13 | 17165c766b3 |
14 | a477c89969 |
15 | 5836d5d228 |
hex | 31aa53c0f9 |
213311013113 has 48 divisors (see below), whose sum is σ = 253908836352. Its totient is φ = 177512364000.
The previous prime is 213311013109. The next prime is 213311013127. The reversal of 213311013113 is 311310113312.
213311013113 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 213311013113 - 22 = 213311013109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213311013313) 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 47 ways as a sum of consecutive naturals, for example, 135779618 + ... + 135781188.
It is an arithmetic number, because the mean of its divisors is an integer number (5289767424).
Almost surely, 2213311013113 is an apocalyptic number.
It is an amenable number.
213311013113 is a deficient number, since it is larger than the sum of its proper divisors (40597823239).
213311013113 is a wasteful number, since it uses less digits than its factorization.
213311013113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2754 (or 2735 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 213311013113 its reverse (311310113312), we get a palindrome (524621126425).
The spelling of 213311013113 in words is "two hundred thirteen billion, three hundred eleven million, thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •