Base | Representation |
---|---|
bin | 11111100011110011101000… |
… | …010100010110110000001001 |
3 | 200012110011012212220202200211 |
4 | 133203303220110112300021 |
5 | 121143100011030201341 |
6 | 1211111511225201121 |
7 | 41143654620210514 |
oct | 3743635024266011 |
9 | 605404185822624 |
10 | 138800060787721 |
11 | 40253858893943 |
12 | 1369846b6301a1 |
13 | 5c5aa358ba378 |
14 | 263bd5cca7d7b |
15 | 110a794d0c181 |
hex | 7e3ce8516c09 |
138800060787721 has 2 divisors, whose sum is σ = 138800060787722. Its totient is φ = 138800060787720.
The previous prime is 138800060787719. The next prime is 138800060787727. The reversal of 138800060787721 is 127787060008831.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 72835385953225 + 65964674834496 = 8534365^2 + 8121864^2 .
It is a cyclic number.
It is not a de Polignac number, because 138800060787721 - 21 = 138800060787719 is a prime.
Together with 138800060787719, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (138800060787727) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69400030393860 + 69400030393861.
It is an arithmetic number, because the mean of its divisors is an integer number (69400030393861).
Almost surely, 2138800060787721 is an apocalyptic number.
It is an amenable number.
138800060787721 is a deficient number, since it is larger than the sum of its proper divisors (1).
138800060787721 is an equidigital number, since it uses as much as digits as its factorization.
138800060787721 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6322176, while the sum is 58.
The spelling of 138800060787721 in words is "one hundred thirty-eight trillion, eight hundred billion, sixty million, seven hundred eighty-seven thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •