Base | Representation |
---|---|
bin | 10000001110010… |
… | …00100001011100 |
3 | 100111001222011010 |
4 | 20013020201130 |
5 | 234314301034 |
6 | 21300455220 |
7 | 3241503660 |
oct | 1007104134 |
9 | 314058133 |
10 | 136087644 |
11 | 6a8aa730 |
12 | 396aa510 |
13 | 2226a644 |
14 | 141068a0 |
15 | be323e9 |
hex | 81c885c |
136087644 has 96 divisors (see below), whose sum is σ = 408748032. Its totient is φ = 34200000.
The previous prime is 136087631. The next prime is 136087657. The reversal of 136087644 is 446780631.
It is an interprime number because it is at equal distance from previous prime (136087631) and next prime (136087657).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 26269 + ... + 31019.
It is an arithmetic number, because the mean of its divisors is an integer number (4257792).
Almost surely, 2136087644 is an apocalyptic number.
136087644 is a gapful number since it is divisible by the number (14) 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 136087644, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (204374016).
136087644 is an abundant number, since it is smaller than the sum of its proper divisors (272660388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136087644 is a wasteful number, since it uses less digits than its factorization.
136087644 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4807 (or 4805 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 39.
The square root of 136087644 is about 11665.6608899796. The cubic root of 136087644 is about 514.3667637254.
The spelling of 136087644 in words is "one hundred thirty-six million, eighty-seven thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •