Base | Representation |
---|---|
bin | 11111001111110100001110… |
… | …011101010110011110010000 |
3 | 200000120211022220121022021002 |
4 | 133033310032131112132100 |
5 | 121003043041123122420 |
6 | 1204140435322521132 |
7 | 40642503050004416 |
oct | 3717641635263620 |
9 | 600524286538232 |
10 | 137426311145360 |
11 | 3a874197a438a6 |
12 | 134b61816661a8 |
13 | 5b8b3265932c3 |
14 | 25d167cb232b6 |
15 | 10d4b91506075 |
hex | 7cfd0e756790 |
137426311145360 has 40 divisors (see below), whose sum is σ = 333408180957120. Its totient is φ = 52580501654912.
The previous prime is 137426311145359. The next prime is 137426311145369. The reversal of 137426311145360 is 63541113624731.
It is a tau number, because it is divible by the number of its divisors (40).
It is not an unprimeable number, because it can be changed into a prime (137426311145369) 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, 37344104450 + ... + 37344108129.
It is an arithmetic number, because the mean of its divisors is an integer number (8335204523928).
Almost surely, 2137426311145360 is an apocalyptic number.
137426311145360 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
137426311145360 is an abundant number, since it is smaller than the sum of its proper divisors (195981869811760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137426311145360 is a wasteful number, since it uses less digits than its factorization.
137426311145360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74688212615 (or 74688212609 counting only the distinct ones).
The product of its (nonzero) digits is 1088640, while the sum is 47.
The spelling of 137426311145360 in words is "one hundred thirty-seven trillion, four hundred twenty-six billion, three hundred eleven million, one hundred forty-five thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.419 sec. • engine limits •