Base | Representation |
---|---|
bin | 11110111101000001001101… |
… | …100101011011101011011101 |
3 | 122212000100011022002220010021 |
4 | 132331001031211123223131 |
5 | 120320412112234303344 |
6 | 1201311210502112141 |
7 | 40450253632361113 |
oct | 3675011545335335 |
9 | 585010138086107 |
10 | 136134585072349 |
11 | 3a4163982854a6 |
12 | 1332796511b651 |
13 | 5ac65896ab366 |
14 | 2588d40389ab3 |
15 | 10b128db89b84 |
hex | 7bd04d95badd |
136134585072349 has 2 divisors, whose sum is σ = 136134585072350. Its totient is φ = 136134585072348.
The previous prime is 136134585072287. The next prime is 136134585072373. The reversal of 136134585072349 is 943270585431631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105137194771449 + 30997390300900 = 10253643^2 + 5567530^2 .
It is a cyclic number.
It is not a de Polignac number, because 136134585072349 - 213 = 136134585064157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136134585072049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68067292536174 + 68067292536175.
It is an arithmetic number, because the mean of its divisors is an integer number (68067292536175).
It is a 1-persistent number, because it is pandigital, but 2⋅136134585072349 = 272269170144698 is not.
Almost surely, 2136134585072349 is an apocalyptic number.
It is an amenable number.
136134585072349 is a deficient number, since it is larger than the sum of its proper divisors (1).
136134585072349 is an equidigital number, since it uses as much as digits as its factorization.
136134585072349 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 65318400, while the sum is 61.
The spelling of 136134585072349 in words is "one hundred thirty-six trillion, one hundred thirty-four billion, five hundred eighty-five million, seventy-two thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •