Base | Representation |
---|---|
bin | 11110100001011000001011… |
… | …101110001000110001111101 |
3 | 122121021202021020022201020001 |
4 | 132201120023232020301331 |
5 | 120043301443223410044 |
6 | 1153254431121354301 |
7 | 40163111012125153 |
oct | 3641301356106175 |
9 | 577252236281201 |
10 | 134235104513149 |
11 | 39853873aa5332 |
12 | 1307b7b4a98991 |
13 | 59b9415457553 |
14 | 25210299333d3 |
15 | 107bb6a8002d4 |
hex | 7a160bb88c7d |
134235104513149 has 2 divisors, whose sum is σ = 134235104513150. Its totient is φ = 134235104513148.
The previous prime is 134235104513057. The next prime is 134235104513207. The reversal of 134235104513149 is 941315401532431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86220695960100 + 48014408553049 = 9285510^2 + 6929243^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134235104513149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 134235104513099 and 134235104513108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134235104513749) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67117552256574 + 67117552256575.
It is an arithmetic number, because the mean of its divisors is an integer number (67117552256575).
Almost surely, 2134235104513149 is an apocalyptic number.
It is an amenable number.
134235104513149 is a deficient number, since it is larger than the sum of its proper divisors (1).
134235104513149 is an equidigital number, since it uses as much as digits as its factorization.
134235104513149 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 777600, while the sum is 46.
The spelling of 134235104513149 in words is "one hundred thirty-four trillion, two hundred thirty-five billion, one hundred four million, five hundred thirteen thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •