Base | Representation |
---|---|
bin | 11111011000010010101010… |
… | …001001010010000000110001 |
3 | 200002122111200122020102112102 |
4 | 133120102222021102000301 |
5 | 121042113401342333430 |
6 | 1205304201442110145 |
7 | 41032542216112052 |
oct | 3730225211220061 |
9 | 602574618212472 |
10 | 138008743714865 |
11 | 3aa791a7a458a1 |
12 | 1358b02904b355 |
13 | 5c012267c620a |
14 | 2611931bbc729 |
15 | 10e4dcde64345 |
hex | 7d84aa252031 |
138008743714865 has 8 divisors (see below), whose sum is σ = 165740179617000. Its totient is φ = 110320536865792.
The previous prime is 138008743714859. The next prime is 138008743714909. The reversal of 138008743714865 is 568417347800831.
It can be written as a sum of positive squares in 4 ways, for example, as 8077378937329 + 129931364777536 = 2842073^2 + 11398744^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-138008743714865 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10807256240 + ... + 10807269009.
It is an arithmetic number, because the mean of its divisors is an integer number (20717522452125).
Almost surely, 2138008743714865 is an apocalyptic number.
It is an amenable number.
138008743714865 is a deficient number, since it is larger than the sum of its proper divisors (27731435902135).
138008743714865 is a wasteful number, since it uses less digits than its factorization.
138008743714865 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21614526531.
The product of its (nonzero) digits is 108380160, while the sum is 65.
The spelling of 138008743714865 in words is "one hundred thirty-eight trillion, eight billion, seven hundred forty-three million, seven hundred fourteen thousand, eight hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •