Base | Representation |
---|---|
bin | 1000000000000101000… |
… | …0010101001000010001 |
3 | 111010210211021002121102 |
4 | 2000001100111020101 |
5 | 4223004230332122 |
6 | 143052005034145 |
7 | 12634246551062 |
oct | 2000120251021 |
9 | 433724232542 |
10 | 137460011537 |
11 | 53329658222 |
12 | 227830b5955 |
13 | cc685a1344 |
14 | 692016c569 |
15 | 3897c47492 |
hex | 2001415211 |
137460011537 has 8 divisors (see below), whose sum is σ = 139809201000. Its totient is φ = 135129844224.
The previous prime is 137460011483. The next prime is 137460011567. The reversal of 137460011537 is 735110064731.
It is a Cunningham number, because it is equal to 3707562+1.
It can be written as a sum of positive squares in 4 ways, for example, as 16104625216 + 121355386321 = 126904^2 + 348361^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 137460011537 - 26 = 137460011473 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 137460011537.
It is not an unprimeable number, because it can be changed into a prime (137460011567) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4740962 + ... + 4769867.
It is an arithmetic number, because the mean of its divisors is an integer number (17476150125).
Almost surely, 2137460011537 is an apocalyptic number.
It is an amenable number.
137460011537 is a deficient number, since it is larger than the sum of its proper divisors (2349189463).
137460011537 is an equidigital number, since it uses as much as digits as its factorization.
137460011537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9511075.
The product of its (nonzero) digits is 52920, while the sum is 38.
The spelling of 137460011537 in words is "one hundred thirty-seven billion, four hundred sixty million, eleven thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •