Base | Representation |
---|---|
bin | 11111000101111010011000… |
… | …001001111111110101011000 |
3 | 122221011202121110011111022120 |
4 | 133011322120021333311120 |
5 | 120410420214202341030 |
6 | 1202500041153221240 |
7 | 40542360312466611 |
oct | 3705723011776530 |
9 | 587152543144276 |
10 | 136745721527640 |
11 | 3a631597937755 |
12 | 134062a1561820 |
13 | 5b3c0b25cbc84 |
14 | 25aa7576a0c08 |
15 | 10c210b54d010 |
hex | 7c5e9827fd58 |
136745721527640 has 32 divisors (see below), whose sum is σ = 410237164583280. Its totient is φ = 36465525740672.
The previous prime is 136745721527629. The next prime is 136745721527659. The reversal of 136745721527640 is 46725127547631.
It is a happy number.
It is a super-2 number, since 2×1367457215276402 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 569773839579 + ... + 569773839818.
Almost surely, 2136745721527640 is an apocalyptic number.
136745721527640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
136745721527640 is an abundant number, since it is smaller than the sum of its proper divisors (273491443055640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136745721527640 is a wasteful number, since it uses less digits than its factorization.
136745721527640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1139547679411 (or 1139547679407 counting only the distinct ones).
The product of its (nonzero) digits is 59270400, while the sum is 60.
The spelling of 136745721527640 in words is "one hundred thirty-six trillion, seven hundred forty-five billion, seven hundred twenty-one million, five hundred twenty-seven thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •