Base | Representation |
---|---|
bin | 11111001000101111000010… |
… | …100010011011011011010000 |
3 | 122221212022022120100222012110 |
4 | 133020233002202123123100 |
5 | 120422110004230303004 |
6 | 1203125122120025320 |
7 | 40562365401255123 |
oct | 3710570242333320 |
9 | 587768276328173 |
10 | 136939706103504 |
11 | 3a6a68920a2747 |
12 | 134379ba602240 |
13 | 5b544885b1985 |
14 | 25b5cba8ba3ba |
15 | 10c71b183e589 |
hex | 7c8bc289b6d0 |
136939706103504 has 80 divisors (see below), whose sum is σ = 378691426483200. Its totient is φ = 42511166552448.
The previous prime is 136939706103457. The next prime is 136939706103587. The reversal of 136939706103504 is 405301607939631.
It is a super-2 number, since 2×1369397061035042 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1272430824 + ... + 1272538439.
It is an arithmetic number, because the mean of its divisors is an integer number (4733642831040).
Almost surely, 2136939706103504 is an apocalyptic number.
It is an amenable number.
136939706103504 is an abundant number, since it is smaller than the sum of its proper divisors (241751720379696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136939706103504 is a wasteful number, since it uses less digits than its factorization.
136939706103504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2544969352 (or 2544969346 counting only the distinct ones).
The product of its (nonzero) digits is 11022480, while the sum is 57.
The spelling of 136939706103504 in words is "one hundred thirty-six trillion, nine hundred thirty-nine billion, seven hundred six million, one hundred three thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •