Base | Representation |
---|---|
bin | 1000000100010101111… |
… | …1000010110010011001 |
3 | 111020202121020021101122 |
4 | 2001011133002302121 |
5 | 4232330302004012 |
6 | 143401340055025 |
7 | 13004516450264 |
oct | 2010537026231 |
9 | 436677207348 |
10 | 138604719257 |
11 | 53866829064 |
12 | 22a42534475 |
13 | 100bb7a65a4 |
14 | 69cc1c7cdb |
15 | 39134aee72 |
hex | 20457c2c99 |
138604719257 has 2 divisors, whose sum is σ = 138604719258. Its totient is φ = 138604719256.
The previous prime is 138604719221. The next prime is 138604719283. The reversal of 138604719257 is 752917406831.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 134910024601 + 3694694656 = 367301^2 + 60784^2 .
It is a cyclic number.
It is not a de Polignac number, because 138604719257 - 224 = 138587942041 is a prime.
It is a super-2 number, since 2×1386047192572 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 138604719199 and 138604719208.
It is not a weakly prime, because it can be changed into another prime (138604719217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69302359628 + 69302359629.
It is an arithmetic number, because the mean of its divisors is an integer number (69302359629).
It is a 1-persistent number, because it is pandigital, but 2⋅138604719257 = 277209438514 is not.
Almost surely, 2138604719257 is an apocalyptic number.
It is an amenable number.
138604719257 is a deficient number, since it is larger than the sum of its proper divisors (1).
138604719257 is an equidigital number, since it uses as much as digits as its factorization.
138604719257 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2540160, while the sum is 53.
The spelling of 138604719257 in words is "one hundred thirty-eight billion, six hundred four million, seven hundred nineteen thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.556 sec. • engine limits •