Base | Representation |
---|---|
bin | 110100110011000001111110… |
… | …100100111110001010101101 |
3 | 1010110011121022002222220210011 |
4 | 310303001332210332022231 |
5 | 220413422310242340411 |
6 | 2141505340151013221 |
7 | 66624163126414324 |
oct | 6463017644761255 |
9 | 1113147262886704 |
10 | 232205235511981 |
11 | 67a95761960a96 |
12 | 22062b1b66a211 |
13 | 9c74b23b4c334 |
14 | 414ab16dcb0bb |
15 | 1bca2cec42c21 |
hex | d3307e93e2ad |
232205235511981 has 2 divisors, whose sum is σ = 232205235511982. Its totient is φ = 232205235511980.
The previous prime is 232205235511969. The next prime is 232205235512011. The reversal of 232205235511981 is 189115532502232.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 231083595656356 + 1121639855625 = 15201434^2 + 1059075^2 .
It is a cyclic number.
It is not a de Polignac number, because 232205235511981 - 213 = 232205235503789 is a prime.
It is a super-2 number, since 2×2322052355119812 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232205235511961) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116102617755990 + 116102617755991.
It is an arithmetic number, because the mean of its divisors is an integer number (116102617755991).
Almost surely, 2232205235511981 is an apocalyptic number.
It is an amenable number.
232205235511981 is a deficient number, since it is larger than the sum of its proper divisors (1).
232205235511981 is an equidigital number, since it uses as much as digits as its factorization.
232205235511981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296000, while the sum is 49.
The spelling of 232205235511981 in words is "two hundred thirty-two trillion, two hundred five billion, two hundred thirty-five million, five hundred eleven thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •