Base | Representation |
---|---|
bin | 11111010011111100111000… |
… | …010111000000000000011000 |
3 | 200001120222211021010122210220 |
4 | 133103330320113000000120 |
5 | 121022222031340340310 |
6 | 1204515153321440040 |
7 | 41002153056061323 |
oct | 3723747027000030 |
9 | 601528737118726 |
10 | 137710481965080 |
11 | 3a973761a67722 |
12 | 13541269940020 |
13 | 5bac072b4713b |
14 | 260131987b7ba |
15 | 10dc2741b2670 |
hex | 7d3f385c0018 |
137710481965080 has 128 divisors (see below), whose sum is σ = 414052077888000. Its totient is φ = 36641051697152.
The previous prime is 137710481965051. The next prime is 137710481965081. The reversal of 137710481965080 is 80569184017731.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137710481965081) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 96847096 + ... + 98258744.
It is an arithmetic number, because the mean of its divisors is an integer number (3234781858500).
Almost surely, 2137710481965080 is an apocalyptic number.
137710481965080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
137710481965080 is an abundant number, since it is smaller than the sum of its proper divisors (276341595922920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137710481965080 is a wasteful number, since it uses less digits than its factorization.
137710481965080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1413473 (or 1413469 counting only the distinct ones).
The product of its (nonzero) digits is 10160640, while the sum is 60.
The spelling of 137710481965080 in words is "one hundred thirty-seven trillion, seven hundred ten billion, four hundred eighty-one million, nine hundred sixty-five thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •