Base | Representation |
---|---|
bin | 1101100010101100110… |
… | …1100100010000100101 |
3 | 211020112000001122200001 |
4 | 3120223031210100211 |
5 | 12302433210220121 |
6 | 254513541421301 |
7 | 22544235442624 |
oct | 3305315442045 |
9 | 736460048601 |
10 | 232653210661 |
11 | 8a738743713 |
12 | 3910b10a831 |
13 | 18c29297ac1 |
14 | b390a5d6bb |
15 | 60b9e8e991 |
hex | 362b364425 |
232653210661 has 2 divisors, whose sum is σ = 232653210662. Its totient is φ = 232653210660.
The previous prime is 232653210641. The next prime is 232653210743. The reversal of 232653210661 is 166012356232.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 205984361025 + 26668849636 = 453855^2 + 163306^2 .
It is a cyclic number.
It is not a de Polignac number, because 232653210661 - 215 = 232653177893 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 232653210661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232653210631) 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, 116326605330 + 116326605331.
It is an arithmetic number, because the mean of its divisors is an integer number (116326605331).
Almost surely, 2232653210661 is an apocalyptic number.
It is an amenable number.
232653210661 is a deficient number, since it is larger than the sum of its proper divisors (1).
232653210661 is an equidigital number, since it uses as much as digits as its factorization.
232653210661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 77760, while the sum is 37.
Adding to 232653210661 its reverse (166012356232), we get a palindrome (398665566893).
The spelling of 232653210661 in words is "two hundred thirty-two billion, six hundred fifty-three million, two hundred ten thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •