Base | Representation |
---|---|
bin | 110100110100101110111010… |
… | …111111111001110110010011 |
3 | 1010110120210020111101101012012 |
4 | 310310232322333321312103 |
5 | 220422331343102302011 |
6 | 2142035203523253135 |
7 | 66635504010404522 |
oct | 6464567277716623 |
9 | 1113523214341165 |
10 | 232322213322131 |
11 | 6803032a87a149 |
12 | 2208172721a1ab |
13 | 9c82b76b8308a |
14 | 4152652bd24b9 |
15 | 1bcd37971ea8b |
hex | d34bbaff9d93 |
232322213322131 has 2 divisors, whose sum is σ = 232322213322132. Its totient is φ = 232322213322130.
The previous prime is 232322213322013. The next prime is 232322213322179. The reversal of 232322213322131 is 131223312223232.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-232322213322131 is a prime.
It is a super-2 number, since 2×2323222133221312 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (232322213322431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116161106661065 + 116161106661066.
It is an arithmetic number, because the mean of its divisors is an integer number (116161106661066).
Almost surely, 2232322213322131 is an apocalyptic number.
232322213322131 is a deficient number, since it is larger than the sum of its proper divisors (1).
232322213322131 is an equidigital number, since it uses as much as digits as its factorization.
232322213322131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31104, while the sum is 32.
Adding to 232322213322131 its reverse (131223312223232), we get a palindrome (363545525545363).
The spelling of 232322213322131 in words is "two hundred thirty-two trillion, three hundred twenty-two billion, two hundred thirteen million, three hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •