Base | Representation |
---|---|
bin | 1101100000101001001… |
… | …1000101111011000101 |
3 | 211012002112000000022222 |
4 | 3120022103011323011 |
5 | 12300320324324031 |
6 | 254343054102125 |
7 | 22524452020526 |
oct | 3301223057305 |
9 | 735075000288 |
10 | 232101011141 |
11 | 8a484a73a7a |
12 | 38b961aa945 |
13 | 18b6ba6741c |
14 | b33b59a84d |
15 | 6086764e7b |
hex | 360a4c5ec5 |
232101011141 has 2 divisors, whose sum is σ = 232101011142. Its totient is φ = 232101011140.
The previous prime is 232101011117. The next prime is 232101011161. The reversal of 232101011141 is 141110101232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 221680888900 + 10420122241 = 470830^2 + 102079^2 .
It is a cyclic number.
It is not a de Polignac number, because 232101011141 - 210 = 232101010117 is a prime.
It is a super-2 number, since 2×2321010111412 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232101011161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116050505570 + 116050505571.
It is an arithmetic number, because the mean of its divisors is an integer number (116050505571).
Almost surely, 2232101011141 is an apocalyptic number.
It is an amenable number.
232101011141 is a deficient number, since it is larger than the sum of its proper divisors (1).
232101011141 is an equidigital number, since it uses as much as digits as its factorization.
232101011141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 232101011141 its reverse (141110101232), we get a palindrome (373211112373).
Subtracting from 232101011141 its reverse (141110101232), we obtain a palindrome (90990909909).
The spelling of 232101011141 in words is "two hundred thirty-two billion, one hundred one million, eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •