Base | Representation |
---|---|
bin | 1101100000011000111… |
… | …0001010001101001101 |
3 | 211011220202021211101002 |
4 | 3120012032022031031 |
5 | 12300200321442401 |
6 | 254332212030045 |
7 | 22522661430626 |
oct | 3300616121515 |
9 | 734822254332 |
10 | 232032609101 |
11 | 8a44a3a4567 |
12 | 38b77302325 |
13 | 18b5a838047 |
14 | b332472a4d |
15 | 6080752a6b |
hex | 360638a34d |
232032609101 has 2 divisors, whose sum is σ = 232032609102. Its totient is φ = 232032609100.
The previous prime is 232032609071. The next prime is 232032609103. The reversal of 232032609101 is 101906230232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 144711768100 + 87320841001 = 380410^2 + 295501^2 .
It is a cyclic number.
It is not a de Polignac number, because 232032609101 - 26 = 232032609037 is a prime.
Together with 232032609103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232032609103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116016304550 + 116016304551.
It is an arithmetic number, because the mean of its divisors is an integer number (116016304551).
Almost surely, 2232032609101 is an apocalyptic number.
It is an amenable number.
232032609101 is a deficient number, since it is larger than the sum of its proper divisors (1).
232032609101 is an equidigital number, since it uses as much as digits as its factorization.
232032609101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 29.
Adding to 232032609101 its reverse (101906230232), we get a palindrome (333938839333).
The spelling of 232032609101 in words is "two hundred thirty-two billion, thirty-two million, six hundred nine thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •