Base | Representation |
---|---|
bin | 1100011001101011101… |
… | …0100100101010110001 |
3 | 202100220222202111122211 |
4 | 3012122322210222301 |
5 | 11442312411141223 |
6 | 241512553132121 |
7 | 21251431613413 |
oct | 3063272445261 |
9 | 670828674584 |
10 | 213052443313 |
11 | 8239a606036 |
12 | 3535a9ba041 |
13 | 17124523408 |
14 | a4517bc9b3 |
15 | 581e2d4d0d |
hex | 319aea4ab1 |
213052443313 has 16 divisors (see below), whose sum is σ = 218133279936. Its totient is φ = 208011810240.
The previous prime is 213052443301. The next prime is 213052443319. The reversal of 213052443313 is 313344250312.
It is a happy number.
213052443313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 213052443313 - 217 = 213052312241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213052443319) 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 15 ways as a sum of consecutive naturals, for example, 43826503 + ... + 43831363.
It is an arithmetic number, because the mean of its divisors is an integer number (13633329996).
Almost surely, 2213052443313 is an apocalyptic number.
It is an amenable number.
213052443313 is a deficient number, since it is larger than the sum of its proper divisors (5080836623).
213052443313 is a wasteful number, since it uses less digits than its factorization.
213052443313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8784.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 213052443313 its reverse (313344250312), we get a palindrome (526396693625).
The spelling of 213052443313 in words is "two hundred thirteen billion, fifty-two million, four hundred forty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •