Base | Representation |
---|---|
bin | 111111110101010100… |
… | …1001110000110010101 |
3 | 111002211101110001122022 |
4 | 1333222221032012111 |
5 | 4221220122112443 |
6 | 142550214142525 |
7 | 12621662250026 |
oct | 1775251160625 |
9 | 432741401568 |
10 | 137080660373 |
11 | 53154506068 |
12 | 22698051a45 |
13 | cc07b0c5b7 |
14 | 68c5a20c4d |
15 | 38747b1e68 |
hex | 1feaa4e195 |
137080660373 has 2 divisors, whose sum is σ = 137080660374. Its totient is φ = 137080660372.
The previous prime is 137080660337. The next prime is 137080660447. The reversal of 137080660373 is 373066080731.
It is a happy number.
Together with previous prime (137080660337) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111754484209 + 25326176164 = 334297^2 + 159142^2 .
It is a cyclic number.
It is not a de Polignac number, because 137080660373 - 28 = 137080660117 is a prime.
It is a super-2 number, since 2×1370806603732 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (137080660303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68540330186 + 68540330187.
It is an arithmetic number, because the mean of its divisors is an integer number (68540330187).
Almost surely, 2137080660373 is an apocalyptic number.
It is an amenable number.
137080660373 is a deficient number, since it is larger than the sum of its proper divisors (1).
137080660373 is an equidigital number, since it uses as much as digits as its factorization.
137080660373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 381024, while the sum is 44.
The spelling of 137080660373 in words is "one hundred thirty-seven billion, eighty million, six hundred sixty thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •