Base | Representation |
---|---|
bin | 11111100101000100001001… |
… | …001011100000110011101001 |
3 | 200012202102100210010010112100 |
4 | 133211010021023200303221 |
5 | 121201004033413314112 |
6 | 1211215325455204013 |
7 | 41153135140633506 |
oct | 3745041113406351 |
9 | 605672323103470 |
10 | 138886511463657 |
11 | 40287490a59261 |
12 | 136b1177816609 |
13 | 5c65c32293499 |
14 | 26422006484ad |
15 | 110cb547872dc |
hex | 7e51092e0ce9 |
138886511463657 has 6 divisors (see below), whose sum is σ = 200613849891962. Its totient is φ = 92591007642432.
The previous prime is 138886511463649. The next prime is 138886511463731. The reversal of 138886511463657 is 756364115688831.
138886511463657 is a `hidden beast` number, since 1 + 3 + 8 + 8 + 8 + 6 + 511 + 46 + 3 + 65 + 7 = 666.
It can be written as a sum of positive squares in only one way, i.e., 123083692187481 + 15802819276176 = 11094309^2 + 3975276^2 .
It is not a de Polignac number, because 138886511463657 - 23 = 138886511463649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (138886511465657) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 7715917303528 + ... + 7715917303545.
Almost surely, 2138886511463657 is an apocalyptic number.
It is an amenable number.
138886511463657 is a deficient number, since it is larger than the sum of its proper divisors (61727338428305).
138886511463657 is a wasteful number, since it uses less digits than its factorization.
138886511463657 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15431834607079 (or 15431834607076 counting only the distinct ones).
The product of its digits is 696729600, while the sum is 72.
The spelling of 138886511463657 in words is "one hundred thirty-eight trillion, eight hundred eighty-six billion, five hundred eleven million, four hundred sixty-three thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •