Base | Representation |
---|---|
bin | 111111011000001101… |
… | …0010010011100101100 |
3 | 111000022022001200101002 |
4 | 1332300122102130230 |
5 | 4212220014330000 |
6 | 142305233535432 |
7 | 12555530041223 |
oct | 1766032223454 |
9 | 430268050332 |
10 | 136103667500 |
11 | 527a2a76939 |
12 | 22464a14578 |
13 | cab05994c8 |
14 | 6831d81cba |
15 | 3818b278d5 |
hex | 1fb069272c |
136103667500 has 120 divisors (see below), whose sum is σ = 308502810000. Its totient is φ = 52480224000.
The previous prime is 136103667487. The next prime is 136103667523. The reversal of 136103667500 is 5766301631.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 10075751 + ... + 10089249.
It is an arithmetic number, because the mean of its divisors is an integer number (2570856750).
Almost surely, 2136103667500 is an apocalyptic number.
136103667500 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 136103667500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154251405000).
136103667500 is an abundant number, since it is smaller than the sum of its proper divisors (172399142500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136103667500 is a wasteful number, since it uses less digits than its factorization.
136103667500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13669 (or 13652 counting only the distinct ones).
The product of its (nonzero) digits is 68040, while the sum is 38.
The spelling of 136103667500 in words is "one hundred thirty-six billion, one hundred three million, six hundred sixty-seven thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •