Base | Representation |
---|---|
bin | 1101100100100001001… |
… | …1111100100001100101 |
3 | 211021210000201100222012 |
4 | 3121020103330201211 |
5 | 12304433201002211 |
6 | 255034221444005 |
7 | 22562314251053 |
oct | 3311023744145 |
9 | 737700640865 |
10 | 233141422181 |
11 | 8a969289208 |
12 | 39226710605 |
13 | 18ca6483265 |
14 | b3d98271d3 |
15 | 60e7c79d8b |
hex | 36484fc865 |
233141422181 has 2 divisors, whose sum is σ = 233141422182. Its totient is φ = 233141422180.
The previous prime is 233141422123. The next prime is 233141422183. The reversal of 233141422181 is 181224141332.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 201291309025 + 31850113156 = 448655^2 + 178466^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-233141422181 is a prime.
It is a super-3 number, since 3×2331414221813 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 233141422183, 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 (233141422183) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116570711090 + 116570711091.
It is an arithmetic number, because the mean of its divisors is an integer number (116570711091).
Almost surely, 2233141422181 is an apocalyptic number.
It is an amenable number.
233141422181 is a deficient number, since it is larger than the sum of its proper divisors (1).
233141422181 is an equidigital number, since it uses as much as digits as its factorization.
233141422181 is an evil number, because the sum of its binary digits is even.
The product of its digits is 9216, while the sum is 32.
The spelling of 233141422181 in words is "two hundred thirty-three billion, one hundred forty-one million, four hundred twenty-two thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •