Base | Representation |
---|---|
bin | 10000010001111… |
… | …11100010001001 |
3 | 100111222201211112 |
4 | 20020333202021 |
5 | 234430400423 |
6 | 21315140105 |
7 | 3245604113 |
oct | 1010774211 |
9 | 314881745 |
10 | 136575113 |
11 | 701029a4 |
12 | 398a4635 |
13 | 223ab49c |
14 | 141d23b3 |
15 | becba78 |
hex | 823f889 |
136575113 has 4 divisors (see below), whose sum is σ = 136602180. Its totient is φ = 136548048.
The previous prime is 136575073. The next prime is 136575139. The reversal of 136575113 is 311575631.
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 85137529 + 51437584 = 9227^2 + 7172^2 .
It is a cyclic number.
It is not a de Polignac number, because 136575113 - 28 = 136574857 is a prime.
It is a super-2 number, since 2×1365751132 = 37305522981925538, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 136575113.
It is not an unprimeable number, because it can be changed into a prime (136575143) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3470 + ... + 16887.
It is an arithmetic number, because the mean of its divisors is an integer number (34150545).
Almost surely, 2136575113 is an apocalyptic number.
It is an amenable number.
136575113 is a deficient number, since it is larger than the sum of its proper divisors (27067).
136575113 is an equidigital number, since it uses as much as digits as its factorization.
136575113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27066.
The product of its digits is 9450, while the sum is 32.
The square root of 136575113 is about 11686.5355430940. The cubic root of 136575113 is about 514.9801896423.
The spelling of 136575113 in words is "one hundred thirty-six million, five hundred seventy-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •