Base | Representation |
---|---|
bin | 11111100010011111111100… |
… | …000001011100000011111111 |
3 | 200012010120021010110101202222 |
4 | 133202133330001130003333 |
5 | 121140111440421403324 |
6 | 1211002330153435555 |
7 | 41134323664136666 |
oct | 3742377401340377 |
9 | 605116233411688 |
10 | 138710197059839 |
11 | 40219734089039 |
12 | 13682b7040bbbb |
13 | 5c5241409b6a2 |
14 | 263787611dddd |
15 | 11082858ec55e |
hex | 7e27fc05c0ff |
138710197059839 has 4 divisors (see below), whose sum is σ = 139203827654640. Its totient is φ = 138216566465040.
The previous prime is 138710197059809. The next prime is 138710197059869. The reversal of 138710197059839 is 938950791017831.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (138710197059809) and next prime (138710197059869).
It is a cyclic number.
It is not a de Polignac number, because 138710197059839 - 224 = 138710180282623 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138710197059809) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 246815296979 + ... + 246815297540.
It is an arithmetic number, because the mean of its divisors is an integer number (34800956913660).
Almost surely, 2138710197059839 is an apocalyptic number.
138710197059839 is a deficient number, since it is larger than the sum of its proper divisors (493630594801).
138710197059839 is an equidigital number, since it uses as much as digits as its factorization.
138710197059839 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 493630594800.
The product of its (nonzero) digits is 102876480, while the sum is 71.
The spelling of 138710197059839 in words is "one hundred thirty-eight trillion, seven hundred ten billion, one hundred ninety-seven million, fifty-nine thousand, eight hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •