Base | Representation |
---|---|
bin | 11111000101110000001001… |
… | …010000010011010011000101 |
3 | 122221010201020201101112020222 |
4 | 133011300021100103103011 |
5 | 120410230213412304444 |
6 | 1202451023014434125 |
7 | 40541521115103035 |
oct | 3705601120232305 |
9 | 587121221345228 |
10 | 136734734103749 |
11 | 3a627969809541 |
12 | 13404135962945 |
13 | 5b3b051188912 |
14 | 25a9dd43458c5 |
15 | 10c1bb6b44eee |
hex | 7c5c094134c5 |
136734734103749 has 2 divisors, whose sum is σ = 136734734103750. Its totient is φ = 136734734103748.
The previous prime is 136734734103743. The next prime is 136734734103763. The reversal of 136734734103749 is 947301437437631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85775937940900 + 50958796162849 = 9261530^2 + 7138543^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-136734734103749 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 136734734103691 and 136734734103700.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136734734103743) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68367367051874 + 68367367051875.
It is an arithmetic number, because the mean of its divisors is an integer number (68367367051875).
Almost surely, 2136734734103749 is an apocalyptic number.
It is an amenable number.
136734734103749 is a deficient number, since it is larger than the sum of its proper divisors (1).
136734734103749 is an equidigital number, since it uses as much as digits as its factorization.
136734734103749 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96018048, while the sum is 62.
The spelling of 136734734103749 in words is "one hundred thirty-six trillion, seven hundred thirty-four billion, seven hundred thirty-four million, one hundred three thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •