Base | Representation |
---|---|
bin | 111111010101111011… |
… | …0010100111001101100 |
3 | 111000002222001020201102 |
4 | 1332223312110321230 |
5 | 4212040421202000 |
6 | 142253501302232 |
7 | 12553610353211 |
oct | 1765366247154 |
9 | 430088036642 |
10 | 136027131500 |
11 | 52763851247 |
12 | 22443264978 |
13 | ca9a77ca30 |
14 | 6825b3bb08 |
15 | 381205a3d5 |
hex | 1fabd94e6c |
136027131500 has 96 divisors (see below), whose sum is σ = 320506804800. Its totient is φ = 50135769600.
The previous prime is 136027131497. The next prime is 136027131563. The reversal of 136027131500 is 5131720631.
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 31 ways as a sum of consecutive naturals, for example, 3680111 + ... + 3716889.
It is an arithmetic number, because the mean of its divisors is an integer number (3338612550).
Almost surely, 2136027131500 is an apocalyptic number.
136027131500 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 136027131500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160253402400).
136027131500 is an abundant number, since it is smaller than the sum of its proper divisors (184479673300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136027131500 is a wasteful number, since it uses less digits than its factorization.
136027131500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37380 (or 37368 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 29.
The spelling of 136027131500 in words is "one hundred thirty-six billion, twenty-seven million, one hundred thirty-one thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •