Base | Representation |
---|---|
bin | 10000010000101… |
… | …01110101010001 |
3 | 100111200001112022 |
4 | 20020111311101 |
5 | 234404414210 |
6 | 21311341225 |
7 | 3244263122 |
oct | 1010256521 |
9 | 314601468 |
10 | 136404305 |
11 | 6aaa6634 |
12 | 39821815 |
13 | 2234b80b |
14 | 1418a049 |
15 | be96155 |
hex | 8215d51 |
136404305 has 4 divisors (see below), whose sum is σ = 163685172. Its totient is φ = 109123440.
The previous prime is 136404263. The next prime is 136404341. The reversal of 136404305 is 503404631.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 36084049 + 100320256 = 6007^2 + 10016^2 .
It is not a de Polignac number, because 136404305 - 28 = 136404049 is a prime.
It is a super-2 number, since 2×1364043052 = 37212268845066050, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13640426 + ... + 13640435.
It is an arithmetic number, because the mean of its divisors is an integer number (40921293).
Almost surely, 2136404305 is an apocalyptic number.
It is an amenable number.
136404305 is a deficient number, since it is larger than the sum of its proper divisors (27280867).
136404305 is an equidigital number, since it uses as much as digits as its factorization.
136404305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27280866.
The product of its (nonzero) digits is 4320, while the sum is 26.
The square root of 136404305 is about 11679.2253595861. The cubic root of 136404305 is about 514.7654130014.
Adding to 136404305 its reverse (503404631), we get a palindrome (639808936).
The spelling of 136404305 in words is "one hundred thirty-six million, four hundred four thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •