Base | Representation |
---|---|
bin | 10000010001111… |
… | …01000110001011 |
3 | 100111222020010211 |
4 | 20020331012023 |
5 | 234430041011 |
6 | 21315021551 |
7 | 3245533033 |
oct | 1010750613 |
9 | 314866124 |
10 | 136565131 |
11 | 700a644a |
12 | 3989a8b7 |
13 | 223a6a91 |
14 | 141cc8c3 |
15 | bec8b21 |
hex | 823d18b |
136565131 has 4 divisors (see below), whose sum is σ = 144598392. Its totient is φ = 128531872.
The previous prime is 136565111. The next prime is 136565159. The reversal of 136565131 is 131565631.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 136565131 - 29 = 136564619 is a prime.
It is a super-2 number, since 2×1365651312 = 37300070010094322, which contains 22 as substring.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 136565093 and 136565102.
It is not an unprimeable number, because it can be changed into a prime (136565111) 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, 4016605 + ... + 4016638.
It is an arithmetic number, because the mean of its divisors is an integer number (36149598).
Almost surely, 2136565131 is an apocalyptic number.
136565131 is a deficient number, since it is larger than the sum of its proper divisors (8033261).
136565131 is an equidigital number, since it uses as much as digits as its factorization.
136565131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8033260.
The product of its digits is 8100, while the sum is 31.
The square root of 136565131 is about 11686.1084626149. The cubic root of 136565131 is about 514.9676430483.
The spelling of 136565131 in words is "one hundred thirty-six million, five hundred sixty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •