Base | Representation |
---|---|
bin | 1000000011010000110… |
… | …1110100000101011001 |
3 | 111020000102001111110012 |
4 | 2000310031310011121 |
5 | 4231232114134123 |
6 | 143312510131305 |
7 | 12664401005312 |
oct | 2006415640531 |
9 | 436012044405 |
10 | 138314989913 |
11 | 5372822a121 |
12 | 229814b0b35 |
13 | 100737635c9 |
14 | 69a1929609 |
15 | 38e7d2e378 |
hex | 2034374159 |
138314989913 has 2 divisors, whose sum is σ = 138314989914. Its totient is φ = 138314989912.
The previous prime is 138314989859. The next prime is 138314989921. The reversal of 138314989913 is 319989413831.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117478933504 + 20836056409 = 342752^2 + 144347^2 .
It is a cyclic number.
It is not a de Polignac number, because 138314989913 - 212 = 138314985817 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (138314989993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69157494956 + 69157494957.
It is an arithmetic number, because the mean of its divisors is an integer number (69157494957).
Almost surely, 2138314989913 is an apocalyptic number.
It is an amenable number.
138314989913 is a deficient number, since it is larger than the sum of its proper divisors (1).
138314989913 is an equidigital number, since it uses as much as digits as its factorization.
138314989913 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5038848, while the sum is 59.
The spelling of 138314989913 in words is "one hundred thirty-eight billion, three hundred fourteen million, nine hundred eighty-nine thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •