Base | Representation |
---|---|
bin | 1000000011000011000… |
… | …0011110110001000001 |
3 | 111012212100212201101221 |
4 | 2000300300132301001 |
5 | 4231122241000034 |
6 | 143303034355041 |
7 | 12663064562413 |
oct | 2006060366101 |
9 | 435770781357 |
10 | 138256968769 |
11 | 536a84aaa67 |
12 | 22965b8ba81 |
13 | 1006472a27a |
14 | 6997d449b3 |
15 | 38e2bbcbb4 |
hex | 2030c1ec41 |
138256968769 has 2 divisors, whose sum is σ = 138256968770. Its totient is φ = 138256968768.
The previous prime is 138256968709. The next prime is 138256968791. The reversal of 138256968769 is 967869652831.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107584000000 + 30672968769 = 328000^2 + 175137^2 .
It is a cyclic number.
It is not a de Polignac number, because 138256968769 - 215 = 138256936001 is a prime.
It is a super-2 number, since 2×1382569687692 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 138256968698 and 138256968707.
It is not a weakly prime, because it can be changed into another prime (138256968709) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69128484384 + 69128484385.
It is an arithmetic number, because the mean of its divisors is an integer number (69128484385).
Almost surely, 2138256968769 is an apocalyptic number.
It is an amenable number.
138256968769 is a deficient number, since it is larger than the sum of its proper divisors (1).
138256968769 is an equidigital number, since it uses as much as digits as its factorization.
138256968769 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 235146240, while the sum is 70.
The spelling of 138256968769 in words is "one hundred thirty-eight billion, two hundred fifty-six million, nine hundred sixty-eight thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •