Base | Representation |
---|---|
bin | 11111010011010000101101… |
… | …010110111011100101100110 |
3 | 200001102110101211201021012120 |
4 | 133103100231112323211212 |
5 | 121020432413001213400 |
6 | 1204441311113130410 |
7 | 40665553531340631 |
oct | 3723205526734546 |
9 | 601373354637176 |
10 | 137663052757350 |
11 | 3a95563345a98a |
12 | 135340319b9a06 |
13 | 5ba7754891b93 |
14 | 25dccda748c18 |
15 | 10dadea37dca0 |
hex | 7d342d5bb966 |
137663052757350 has 48 divisors (see below), whose sum is σ = 344784612171600. Its totient is φ = 36346680592000.
The previous prime is 137663052757337. The next prime is 137663052757361. The reversal of 137663052757350 is 53757250366731.
It is a happy number.
It is a super-2 number, since 2×1376630527573502 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4543319925 + ... + 4543350224.
It is an arithmetic number, because the mean of its divisors is an integer number (7183012753575).
Almost surely, 2137663052757350 is an apocalyptic number.
137663052757350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
137663052757350 is an abundant number, since it is smaller than the sum of its proper divisors (207121559414250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137663052757350 is a wasteful number, since it uses less digits than its factorization.
137663052757350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9086670265 (or 9086670260 counting only the distinct ones).
The product of its (nonzero) digits is 83349000, while the sum is 60.
The spelling of 137663052757350 in words is "one hundred thirty-seven trillion, six hundred sixty-three billion, fifty-two million, seven hundred fifty-seven thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •