Base | Representation |
---|---|
bin | 10000010001011… |
… | …10101100011101 |
3 | 100111212020020000 |
4 | 20020232230131 |
5 | 234421144031 |
6 | 21313444513 |
7 | 3245166042 |
oct | 1010565435 |
9 | 314766200 |
10 | 136506141 |
11 | 700660a2 |
12 | 39870739 |
13 | 22385c85 |
14 | 141b51c9 |
15 | beb63e6 |
hex | 822eb1d |
136506141 has 20 divisors (see below), whose sum is σ = 215913852. Its totient is φ = 85650048.
The previous prime is 136506137. The next prime is 136506151. The reversal of 136506141 is 141605631.
136506141 is a `hidden beast` number, since 1 + 3 + 650 + 6 + 1 + 4 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 80030916 + 56475225 = 8946^2 + 7515^2 .
It is not a de Polignac number, because 136506141 - 22 = 136506137 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136506121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 48190 + ... + 50943.
Almost surely, 2136506141 is an apocalyptic number.
It is an amenable number.
136506141 is a deficient number, since it is larger than the sum of its proper divisors (79407711).
136506141 is an equidigital number, since it uses as much as digits as its factorization.
136506141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99162 (or 99153 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 136506141 is about 11683.5842531305. The cubic root of 136506141 is about 514.8934847424.
It can be divided in two parts, 13650 and 6141, that added together give a palindrome (19791).
The spelling of 136506141 in words is "one hundred thirty-six million, five hundred six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •