Base | Representation |
---|---|
bin | 11110101101011010110000… |
… | …100010001100110101011100 |
3 | 122201012211221002012100101020 |
4 | 132231122300202030311130 |
5 | 120200331001324024000 |
6 | 1155130505114044140 |
7 | 40306641512142663 |
oct | 3655326042146534 |
9 | 581184832170336 |
10 | 135062503345500 |
11 | 3a042760080325 |
12 | 13194027119650 |
13 | 5a49454907753 |
14 | 254d0baa79dda |
15 | 10934441a9ba0 |
hex | 7ad6b088cd5c |
135062503345500 has 48 divisors (see below), whose sum is σ = 393302009746464. Its totient is φ = 36016667558400.
The previous prime is 135062503345493. The next prime is 135062503345529. The reversal of 135062503345500 is 5543305260531.
135062503345500 is digitally balanced in base 3 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45020832949 + ... + 45020835948.
It is an arithmetic number, because the mean of its divisors is an integer number (8193791869718).
Almost surely, 2135062503345500 is an apocalyptic number.
135062503345500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
135062503345500 is an abundant number, since it is smaller than the sum of its proper divisors (258239506400964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135062503345500 is a wasteful number, since it uses less digits than its factorization.
135062503345500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90041668919 (or 90041668907 counting only the distinct ones).
The product of its (nonzero) digits is 810000, while the sum is 42.
The spelling of 135062503345500 in words is "one hundred thirty-five trillion, sixty-two billion, five hundred three million, three hundred forty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •