Base | Representation |
---|---|
bin | 1000000001000111101… |
… | …1110101010100110001 |
3 | 111011112022211102021002 |
4 | 2000101323311110301 |
5 | 4224042400213212 |
6 | 143135443011345 |
7 | 12644215262534 |
oct | 2002173652461 |
9 | 434468742232 |
10 | 137739851057 |
11 | 53462611856 |
12 | 22840969b55 |
13 | ccb1560963 |
14 | 69493b4a1b |
15 | 38b25c2ac2 |
hex | 2011ef5531 |
137739851057 has 2 divisors, whose sum is σ = 137739851058. Its totient is φ = 137739851056.
The previous prime is 137739851033. The next prime is 137739851059. The reversal of 137739851057 is 750158937731.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 133014113521 + 4725737536 = 364711^2 + 68744^2 .
It is a cyclic number.
It is not a de Polignac number, because 137739851057 - 222 = 137735656753 is a prime.
Together with 137739851059, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 137739850993 and 137739851011.
It is not a weakly prime, because it can be changed into another prime (137739851059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68869925528 + 68869925529.
It is an arithmetic number, because the mean of its divisors is an integer number (68869925529).
Almost surely, 2137739851057 is an apocalyptic number.
It is an amenable number.
137739851057 is a deficient number, since it is larger than the sum of its proper divisors (1).
137739851057 is an equidigital number, since it uses as much as digits as its factorization.
137739851057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5556600, while the sum is 56.
The spelling of 137739851057 in words is "one hundred thirty-seven billion, seven hundred thirty-nine million, eight hundred fifty-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •