Base | Representation |
---|---|
bin | 111111100101100100… |
… | …1111110110010011100 |
3 | 111001110120101111202222 |
4 | 1333023021332302130 |
5 | 4214124402040000 |
6 | 142421543204512 |
7 | 12602616025520 |
oct | 1771311766234 |
9 | 431416344688 |
10 | 136552377500 |
11 | 52a03291350 |
12 | 2256b146738 |
13 | cb52533c96 |
14 | 68757c5d80 |
15 | 384320da85 |
hex | 1fcb27ec9c |
136552377500 has 240 divisors, whose sum is σ = 374083454976. Its totient is φ = 42357600000.
The previous prime is 136552377499. The next prime is 136552377547. The reversal of 136552377500 is 5773255631.
It is a Harshad number since it is a multiple of its sum of digits (44).
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 79 ways as a sum of consecutive naturals, for example, 42925910 + ... + 42929090.
Almost surely, 2136552377500 is an apocalyptic number.
136552377500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 136552377500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (187041727488).
136552377500 is an abundant number, since it is smaller than the sum of its proper divisors (237531077476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136552377500 is a wasteful number, since it uses less digits than its factorization.
136552377500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3446 (or 3429 counting only the distinct ones).
The product of its (nonzero) digits is 661500, while the sum is 44.
The spelling of 136552377500 in words is "one hundred thirty-six billion, five hundred fifty-two million, three hundred seventy-seven thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.163 sec. • engine limits •