Base | Representation |
---|---|
bin | 1101100000011000100… |
… | …0110100101001111111 |
3 | 211011220122122202022122 |
4 | 3120012020310221333 |
5 | 12300144442210421 |
6 | 254332122033155 |
7 | 22522643513141 |
oct | 3300610645177 |
9 | 734818582278 |
10 | 232031210111 |
11 | 8a449629478 |
12 | 38b769487bb |
13 | 18b5a46833c |
14 | b3321cac91 |
15 | 60805782ab |
hex | 3606234a7f |
232031210111 has 2 divisors, whose sum is σ = 232031210112. Its totient is φ = 232031210110.
The previous prime is 232031210093. The next prime is 232031210207. The reversal of 232031210111 is 111012130232.
232031210111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 232031210111 - 226 = 231964101247 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 232031210111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232031210011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116015605055 + 116015605056.
It is an arithmetic number, because the mean of its divisors is an integer number (116015605056).
Almost surely, 2232031210111 is an apocalyptic number.
232031210111 is a deficient number, since it is larger than the sum of its proper divisors (1).
232031210111 is an equidigital number, since it uses as much as digits as its factorization.
232031210111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 232031210111 its reverse (111012130232), we get a palindrome (343043340343).
The spelling of 232031210111 in words is "two hundred thirty-two billion, thirty-one million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •