Base | Representation |
---|---|
bin | 11111000100111010100000… |
… | …011000100001110011010100 |
3 | 122220221012120220001212102001 |
4 | 133010322200120201303110 |
5 | 120403304240324442110 |
6 | 1202404340014525044 |
7 | 40534411642002631 |
oct | 3704724030416324 |
9 | 586835526055361 |
10 | 136677140077780 |
11 | 3a6054a4454375 |
12 | 133b4b41806784 |
13 | 5b357a3029603 |
14 | 25a72cd229188 |
15 | 10c044574863a |
hex | 7c4ea0621cd4 |
136677140077780 has 12 divisors (see below), whose sum is σ = 287021994163380. Its totient is φ = 54670856031104.
The previous prime is 136677140077739. The next prime is 136677140077799. The reversal of 136677140077780 is 87770041776631.
It can be written as a sum of positive squares in 2 ways, for example, as 90773561130256 + 45903578947524 = 9527516^2 + 6775218^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3416928501925 + ... + 3416928501964.
It is an arithmetic number, because the mean of its divisors is an integer number (23918499513615).
Almost surely, 2136677140077780 is an apocalyptic number.
136677140077780 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
136677140077780 is an abundant number, since it is smaller than the sum of its proper divisors (150344854085600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136677140077780 is a wasteful number, since it uses less digits than its factorization.
136677140077780 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6833857003898 (or 6833857003896 counting only the distinct ones).
The product of its (nonzero) digits is 58084992, while the sum is 64.
The spelling of 136677140077780 in words is "one hundred thirty-six trillion, six hundred seventy-seven billion, one hundred forty million, seventy-seven thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •