Base | Representation |
---|---|
bin | 1000000000010010101… |
… | …0010010101101010001 |
3 | 111010221210202222111002 |
4 | 2000010222102231101 |
5 | 4223113342232014 |
6 | 143101405431345 |
7 | 12635542323452 |
oct | 2000452225521 |
9 | 433853688432 |
10 | 137517149009 |
11 | 53358933479 |
12 | 2279a26b555 |
13 | cc773883b6 |
14 | 69279a3129 |
15 | 389cc81dde |
hex | 2004a92b51 |
137517149009 has 2 divisors, whose sum is σ = 137517149010. Its totient is φ = 137517149008.
The previous prime is 137517148907. The next prime is 137517149027. The reversal of 137517149009 is 900941715731.
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., 129620160784 + 7896988225 = 360028^2 + 88865^2 .
It is a cyclic number.
It is not a de Polignac number, because 137517149009 - 28 = 137517148753 is a prime.
It is not a weakly prime, because it can be changed into another prime (137517149039) 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, 68758574504 + 68758574505.
It is an arithmetic number, because the mean of its divisors is an integer number (68758574505).
Almost surely, 2137517149009 is an apocalyptic number.
It is an amenable number.
137517149009 is a deficient number, since it is larger than the sum of its proper divisors (1).
137517149009 is an equidigital number, since it uses as much as digits as its factorization.
137517149009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 238140, while the sum is 47.
The spelling of 137517149009 in words is "one hundred thirty-seven billion, five hundred seventeen million, one hundred forty-nine thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •