Base | Representation |
---|---|
bin | 110000011110111010111101… |
… | …110001011100010100110101 |
3 | 1000221222200211002102220201012 |
4 | 300132322331301130110311 |
5 | 210422034323314411432 |
6 | 2033301010125042005 |
7 | 62625304120541354 |
oct | 6036727561342465 |
9 | 1027880732386635 |
10 | 213231130232117 |
11 | 61a3a8a61013a8 |
12 | 1bab97560b6305 |
13 | 91c97bc835a4a |
14 | 3a9262830399b |
15 | 199b96eb2ccb2 |
hex | c1eebdc5c535 |
213231130232117 has 2 divisors, whose sum is σ = 213231130232118. Its totient is φ = 213231130232116.
The previous prime is 213231130232101. The next prime is 213231130232143. The reversal of 213231130232117 is 711232031132312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 168254779345636 + 44976350886481 = 12971306^2 + 6706441^2 .
It is a cyclic number.
It is not a de Polignac number, because 213231130232117 - 24 = 213231130232101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213231130237117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106615565116058 + 106615565116059.
It is an arithmetic number, because the mean of its divisors is an integer number (106615565116059).
Almost surely, 2213231130232117 is an apocalyptic number.
It is an amenable number.
213231130232117 is a deficient number, since it is larger than the sum of its proper divisors (1).
213231130232117 is an equidigital number, since it uses as much as digits as its factorization.
213231130232117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 32.
Adding to 213231130232117 its reverse (711232031132312), we get a palindrome (924463161364429).
The spelling of 213231130232117 in words is "two hundred thirteen trillion, two hundred thirty-one billion, one hundred thirty million, two hundred thirty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •