Base | Representation |
---|---|
bin | 111111100111001100… |
… | …0011110110000011111 |
3 | 111001121100020201202111 |
4 | 1333032120132300133 |
5 | 4214232231310421 |
6 | 142431155334451 |
7 | 12604144114531 |
oct | 1771630366037 |
9 | 431540221674 |
10 | 136606510111 |
11 | 52a308a4a45 |
12 | 225852b1427 |
13 | cb60808406 |
14 | 687ca77851 |
15 | 3847d52ee1 |
hex | 1fce61ec1f |
136606510111 has 2 divisors, whose sum is σ = 136606510112. Its totient is φ = 136606510110.
The previous prime is 136606510093. The next prime is 136606510121. The reversal of 136606510111 is 111015606631.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 136606510111 - 213 = 136606501919 is a prime.
It is a super-2 number, since 2×1366065101112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136606510121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68303255055 + 68303255056.
It is an arithmetic number, because the mean of its divisors is an integer number (68303255056).
Almost surely, 2136606510111 is an apocalyptic number.
136606510111 is a deficient number, since it is larger than the sum of its proper divisors (1).
136606510111 is an equidigital number, since it uses as much as digits as its factorization.
136606510111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 31.
The spelling of 136606510111 in words is "one hundred thirty-six billion, six hundred six million, five hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •