Base | Representation |
---|---|
bin | 11110111100100111101001… |
… | …110100001100111110000000 |
3 | 122211220201022201000211221022 |
4 | 132330213221310030332000 |
5 | 120314434411200401010 |
6 | 1201250431345245012 |
7 | 40445262563230442 |
oct | 3674475164147600 |
9 | 584821281024838 |
10 | 136107141418880 |
11 | 3a405795030455 |
12 | 13322586333768 |
13 | 5ac3b04b13758 |
14 | 258789965c492 |
15 | 10b06d46bbd55 |
hex | 7bc9e9d0cf80 |
136107141418880 has 64 divisors (see below), whose sum is σ = 325497471425280. Its totient is φ = 54423391119360.
The previous prime is 136107141418877. The next prime is 136107141418889. The reversal of 136107141418880 is 88814141701631.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136107141418889) 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, 36226976 + ... + 39807135.
It is an arithmetic number, because the mean of its divisors is an integer number (5085897991020).
Almost surely, 2136107141418880 is an apocalyptic number.
136107141418880 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
136107141418880 is an abundant number, since it is smaller than the sum of its proper divisors (189390330006400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136107141418880 is an equidigital number, since it uses as much as digits as its factorization.
136107141418880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76036927 (or 76036915 counting only the distinct ones).
The product of its (nonzero) digits is 1032192, while the sum is 53.
The spelling of 136107141418880 in words is "one hundred thirty-six trillion, one hundred seven billion, one hundred forty-one million, four hundred eighteen thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •