Base | Representation |
---|---|
bin | 1100011010101001010… |
… | …1010100001110101101 |
3 | 202101121000111020112121 |
4 | 3012222111110032231 |
5 | 11443330121041414 |
6 | 241554353232541 |
7 | 21261022352014 |
oct | 3065225241655 |
9 | 671530436477 |
10 | 213311112109 |
11 | 8251261a7a7 |
12 | 35411562751 |
13 | 17165cac784 |
14 | a477cb3a7b |
15 | 5836d7c724 |
hex | 31aa5543ad |
213311112109 has 32 divisors (see below), whose sum is σ = 229991886432. Its totient is φ = 197130240000.
The previous prime is 213311112107. The next prime is 213311112121. The reversal of 213311112109 is 901211113312.
213311112109 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 16 ways, for example, as 28587370084 + 184723742025 = 169078^2 + 429795^2 .
It is a cyclic number.
It is not a de Polignac number, because 213311112109 - 21 = 213311112107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213311112107) 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 31 ways as a sum of consecutive naturals, for example, 114620839 + ... + 114622699.
It is an arithmetic number, because the mean of its divisors is an integer number (7187246451).
Almost surely, 2213311112109 is an apocalyptic number.
It is an amenable number.
213311112109 is a deficient number, since it is larger than the sum of its proper divisors (16680774323).
213311112109 is a wasteful number, since it uses less digits than its factorization.
213311112109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2497.
The product of its (nonzero) digits is 324, while the sum is 25.
The spelling of 213311112109 in words is "two hundred thirteen billion, three hundred eleven million, one hundred twelve thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •