Base | Representation |
---|---|
bin | 10000010011111… |
… | …10111011110101 |
3 | 100112110221001202 |
4 | 20021332323311 |
5 | 240012203210 |
6 | 21324502245 |
7 | 3251035202 |
oct | 1011767365 |
9 | 315427052 |
10 | 136834805 |
11 | 70270018 |
12 | 399aa985 |
13 | 2246c753 |
14 | 1425cca9 |
15 | c02d9a5 |
hex | 827eef5 |
136834805 has 4 divisors (see below), whose sum is σ = 164201772. Its totient is φ = 109467840.
The previous prime is 136834801. The next prime is 136834811. The reversal of 136834805 is 508438631.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 508438631 = 443 ⋅1147717.
It can be written as a sum of positive squares in 2 ways, for example, as 108201604 + 28633201 = 10402^2 + 5351^2 .
It is not a de Polignac number, because 136834805 - 22 = 136834801 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136834801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13683476 + ... + 13683485.
It is an arithmetic number, because the mean of its divisors is an integer number (41050443).
Almost surely, 2136834805 is an apocalyptic number.
It is an amenable number.
136834805 is a deficient number, since it is larger than the sum of its proper divisors (27366967).
136834805 is an equidigital number, since it uses as much as digits as its factorization.
136834805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27366966.
The product of its (nonzero) digits is 69120, while the sum is 38.
The square root of 136834805 is about 11697.6410015011. The cubic root of 136834805 is about 515.3063875790.
The spelling of 136834805 in words is "one hundred thirty-six million, eight hundred thirty-four thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •