Base | Representation |
---|---|
bin | 11110111100001001011000… |
… | …101111111111100010000000 |
3 | 122211210121102211020101111020 |
4 | 132330021120233333202000 |
5 | 120313421332032112442 |
6 | 1201223454500145440 |
7 | 40443032334024141 |
oct | 3674113057774200 |
9 | 584717384211436 |
10 | 136074642847872 |
11 | 3a3a2a2847a003 |
12 | 13318216698280 |
13 | 5ac0a25bcc791 |
14 | 2586095455ac8 |
15 | 10ae93154a9ec |
hex | 7bc258bff880 |
136074642847872 has 128 divisors (see below), whose sum is σ = 370303149623040. Its totient is φ = 44253102563328.
The previous prime is 136074642847807. The next prime is 136074642847973. The reversal of 136074642847872 is 278748246470631.
It is a tau number, because it is divible by the number of its divisors (128).
It is a junction number, because it is equal to n+sod(n) for n = 136074642847797 and 136074642847806.
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, 6170893 + ... + 17613324.
It is an arithmetic number, because the mean of its divisors is an integer number (2892993356430).
Almost surely, 2136074642847872 is an apocalyptic number.
136074642847872 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
136074642847872 is an abundant number, since it is smaller than the sum of its proper divisors (234228506775168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136074642847872 is a wasteful number, since it uses less digits than its factorization.
136074642847872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23784598 (or 23784586 counting only the distinct ones).
The product of its (nonzero) digits is 606928896, while the sum is 69.
The spelling of 136074642847872 in words is "one hundred thirty-six trillion, seventy-four billion, six hundred forty-two million, eight hundred forty-seven thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •