Base | Representation |
---|---|
bin | 10000010100101… |
… | …11110011010000 |
3 | 100112200002210000 |
4 | 20022113303100 |
5 | 240023433111 |
6 | 21331010000 |
7 | 3251641143 |
oct | 1012276320 |
9 | 315602700 |
10 | 136936656 |
11 | 7032a59a |
12 | 39a39900 |
13 | 224a6c0c |
14 | 1428805a |
15 | c04dc56 |
hex | 8297cd0 |
136936656 has 100 divisors (see below), whose sum is σ = 399451492. Its totient is φ = 45287424.
The previous prime is 136936609. The next prime is 136936669. The reversal of 136936656 is 656639631.
It can be written as a sum of positive squares in 2 ways, for example, as 42458256 + 94478400 = 6516^2 + 9720^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 203136 + ... + 203808.
Almost surely, 2136936656 is an apocalyptic number.
136936656 is a gapful number since it is divisible by the number (16) 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 136936656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (199725746).
136936656 is an abundant number, since it is smaller than the sum of its proper divisors (262514836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136936656 is a wasteful number, since it uses less digits than its factorization.
136936656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 850 (or 835 counting only the distinct ones).
The product of its digits is 524880, while the sum is 45.
The square root of 136936656 is about 11701.9936762929. The cubic root of 136936656 is about 515.4342094789.
It can be divided in two parts, 1369 and 36656, that added together give a square (38025 = 1952).
The spelling of 136936656 in words is "one hundred thirty-six million, nine hundred thirty-six thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •