Base | Representation |
---|---|
bin | 10000010001111… |
… | …01001110010010 |
3 | 100111222020212001 |
4 | 20020331032102 |
5 | 234430100100 |
6 | 21315024214 |
7 | 3245534404 |
oct | 1010751622 |
9 | 314866761 |
10 | 136565650 |
11 | 700a6881 |
12 | 3989b06a |
13 | 223a70a0 |
14 | 141ccb74 |
15 | bec8d6a |
hex | 823d392 |
136565650 has 24 divisors (see below), whose sum is σ = 273552804. Its totient is φ = 50424000.
The previous prime is 136565647. The next prime is 136565657. The reversal of 136565650 is 56565631.
It is a happy number.
136565650 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 6765201 + 129800449 = 2601^2 + 11393^2 .
It is not an unprimeable number, because it can be changed into a prime (136565657) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 104401 + ... + 105700.
Almost surely, 2136565650 is an apocalyptic number.
136565650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
136565650 is an abundant number, since it is smaller than the sum of its proper divisors (136987154).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136565650 is a wasteful number, since it uses less digits than its factorization.
136565650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 210126 (or 210121 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 37.
The square root of 136565650 is about 11686.1306684463. The cubic root of 136565650 is about 514.9682954058.
It can be divided in two parts, 13656 and 5650, that added together give a triangular number (19306 = T196).
The spelling of 136565650 in words is "one hundred thirty-six million, five hundred sixty-five thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •