Base | Representation |
---|---|
bin | 110000000100100101… |
… | …1011100111011101101 |
3 | 100212110111111112111112 |
4 | 1200021023130323231 |
5 | 3142410200242031 |
6 | 115231422001405 |
7 | 10313133552653 |
oct | 1401113347355 |
9 | 325414445445 |
10 | 103233212141 |
11 | 3a865503254 |
12 | 18010716265 |
13 | 9972609317 |
14 | 4dd4612dd3 |
15 | 2a42ee862b |
hex | 18092dceed |
103233212141 has 2 divisors, whose sum is σ = 103233212142. Its totient is φ = 103233212140.
The previous prime is 103233212077. The next prime is 103233212161. The reversal of 103233212141 is 141212332301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 53097524041 + 50135688100 = 230429^2 + 223910^2 .
It is a cyclic number.
It is not a de Polignac number, because 103233212141 - 26 = 103233212077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103233212161) 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, 51616606070 + 51616606071.
It is an arithmetic number, because the mean of its divisors is an integer number (51616606071).
Almost surely, 2103233212141 is an apocalyptic number.
It is an amenable number.
103233212141 is a deficient number, since it is larger than the sum of its proper divisors (1).
103233212141 is an equidigital number, since it uses as much as digits as its factorization.
103233212141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 103233212141 its reverse (141212332301), we get a palindrome (244445544442).
The spelling of 103233212141 in words is "one hundred three billion, two hundred thirty-three million, two hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •