Base | Representation |
---|---|
bin | 111111100111010101… |
… | …0000010010001001101 |
3 | 111001121122220112101022 |
4 | 1333032222002101031 |
5 | 4214234421041023 |
6 | 142431442123525 |
7 | 12604231202255 |
oct | 1771652022115 |
9 | 431548815338 |
10 | 136611112013 |
11 | 52a33458472 |
12 | 225869505a5 |
13 | cb61759c2c |
14 | 687d514965 |
15 | 38484617c8 |
hex | 1fcea8244d |
136611112013 has 12 divisors (see below), whose sum is σ = 144210504060. Its totient is φ = 129393308736.
The previous prime is 136611112009. The next prime is 136611112019. The reversal of 136611112013 is 310211116631.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 23347228804 + 113263883209 = 152798^2 + 336547^2 .
It is not a de Polignac number, because 136611112013 - 22 = 136611112009 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 (136611112019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1755731 + ... + 1831887.
It is an arithmetic number, because the mean of its divisors is an integer number (12017542005).
Almost surely, 2136611112013 is an apocalyptic number.
It is an amenable number.
136611112013 is a deficient number, since it is larger than the sum of its proper divisors (7599392047).
136611112013 is an equidigital number, since it uses as much as digits as its factorization.
136611112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81164 (or 81145 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 26.
Adding to 136611112013 its reverse (310211116631), we get a palindrome (446822228644).
The spelling of 136611112013 in words is "one hundred thirty-six billion, six hundred eleven million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.178 sec. • engine limits •