Base | Representation |
---|---|
bin | 110100110100101100111110… |
… | …111101000011101101111111 |
3 | 1010110120120212110101111011111 |
4 | 310310230332331003231333 |
5 | 220422313112320420333 |
6 | 2142034221221502451 |
7 | 66635401310231134 |
oct | 6464547675035577 |
9 | 1113516773344144 |
10 | 232320132201343 |
11 | 6802a46206630a |
12 | 22081246271a27 |
13 | 9c82904975464 |
14 | 41524d665c58b |
15 | 1bcd2a6b864cd |
hex | d34b3ef43b7f |
232320132201343 has 2 divisors, whose sum is σ = 232320132201344. Its totient is φ = 232320132201342.
The previous prime is 232320132201341. The next prime is 232320132201359. The reversal of 232320132201343 is 343102231023232.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 232320132201343 - 21 = 232320132201341 is a prime.
Together with 232320132201341, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232320132201341) 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, 116160066100671 + 116160066100672.
It is an arithmetic number, because the mean of its divisors is an integer number (116160066100672).
Almost surely, 2232320132201343 is an apocalyptic number.
232320132201343 is a deficient number, since it is larger than the sum of its proper divisors (1).
232320132201343 is an equidigital number, since it uses as much as digits as its factorization.
232320132201343 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 232320132201343 its reverse (343102231023232), we get a palindrome (575422363224575).
The spelling of 232320132201343 in words is "two hundred thirty-two trillion, three hundred twenty billion, one hundred thirty-two million, two hundred one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •