Base | Representation |
---|---|
bin | 110000000100110110… |
… | …1011111001001111101 |
3 | 100212111010021211011222 |
4 | 1200021231133021331 |
5 | 3142414441243031 |
6 | 115232341123125 |
7 | 10313302442426 |
oct | 1401155371175 |
9 | 325433254158 |
10 | 103242134141 |
11 | 3a86a547503 |
12 | 180136b94a5 |
13 | 9974411303 |
14 | 4dd589664d |
15 | 2a43babe7b |
hex | 1809b5f27d |
103242134141 has 2 divisors, whose sum is σ = 103242134142. Its totient is φ = 103242134140.
The previous prime is 103242134137. The next prime is 103242134161. The reversal of 103242134141 is 141431242301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98703417241 + 4538716900 = 314171^2 + 67370^2 .
It is an emirp because it is prime and its reverse (141431242301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103242134141 - 22 = 103242134137 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103242134141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103242134101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51621067070 + 51621067071.
It is an arithmetic number, because the mean of its divisors is an integer number (51621067071).
Almost surely, 2103242134141 is an apocalyptic number.
It is an amenable number.
103242134141 is a deficient number, since it is larger than the sum of its proper divisors (1).
103242134141 is an equidigital number, since it uses as much as digits as its factorization.
103242134141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 103242134141 its reverse (141431242301), we get a palindrome (244673376442).
The spelling of 103242134141 in words is "one hundred three billion, two hundred forty-two million, one hundred thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •