Base | Representation |
---|---|
bin | 1000000011000000101… |
… | …0111011100001111001 |
3 | 111012211200100121110002 |
4 | 2000300022323201321 |
5 | 4231112231000423 |
6 | 143302043402345 |
7 | 12662615113616 |
oct | 2006012734171 |
9 | 435750317402 |
10 | 138247125113 |
11 | 536a2997309 |
12 | 229628233b5 |
13 | 10062691916 |
14 | 699690150d |
15 | 38e1dc6228 |
hex | 20302bb879 |
138247125113 has 2 divisors, whose sum is σ = 138247125114. Its totient is φ = 138247125112.
The previous prime is 138247125083. The next prime is 138247125131. The reversal of 138247125113 is 311521742831.
Together with next prime (138247125131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129659766889 + 8587358224 = 360083^2 + 92668^2 .
It is a cyclic number.
It is not a de Polignac number, because 138247125113 - 212 = 138247121017 is a prime.
It is a super-2 number, since 2×1382471251132 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (138247155113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69123562556 + 69123562557.
It is an arithmetic number, because the mean of its divisors is an integer number (69123562557).
Almost surely, 2138247125113 is an apocalyptic number.
It is an amenable number.
138247125113 is a deficient number, since it is larger than the sum of its proper divisors (1).
138247125113 is an equidigital number, since it uses as much as digits as its factorization.
138247125113 is an evil number, because the sum of its binary digits is even.
The product of its digits is 40320, while the sum is 38.
Adding to 138247125113 its reverse (311521742831), we get a palindrome (449768867944).
The spelling of 138247125113 in words is "one hundred thirty-eight billion, two hundred forty-seven million, one hundred twenty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •