Base | Representation |
---|---|
bin | 1100011010110000001… |
… | …1101010101110110001 |
3 | 202101200000220221022011 |
4 | 3012230003222232301 |
5 | 11443410022240423 |
6 | 242001305242521 |
7 | 21261523264144 |
oct | 3065403525661 |
9 | 671600827264 |
10 | 213340040113 |
11 | 82527988842 |
12 | 3541b193441 |
13 | 1716bc9a835 |
14 | a47ba8405b |
15 | 5839693b0d |
hex | 31ac0eabb1 |
213340040113 has 2 divisors, whose sum is σ = 213340040114. Its totient is φ = 213340040112.
The previous prime is 213340040099. The next prime is 213340040143. The reversal of 213340040113 is 311040043312.
213340040113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 212823523584 + 516516529 = 461328^2 + 22727^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213340040113 is a prime.
It is not a weakly prime, because it can be changed into another prime (213340040143) 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 as a sum of consecutive naturals, namely, 106670020056 + 106670020057.
It is an arithmetic number, because the mean of its divisors is an integer number (106670020057).
Almost surely, 2213340040113 is an apocalyptic number.
It is an amenable number.
213340040113 is a deficient number, since it is larger than the sum of its proper divisors (1).
213340040113 is an equidigital number, since it uses as much as digits as its factorization.
213340040113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 213340040113 its reverse (311040043312), we get a palindrome (524380083425).
The spelling of 213340040113 in words is "two hundred thirteen billion, three hundred forty million, forty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •