Base | Representation |
---|---|
bin | 11110100110101111001000… |
… | …011101101001111100101101 |
3 | 122122120221202102120121120101 |
4 | 132212233020131221330231 |
5 | 120120320121341302131 |
6 | 1154135531112551101 |
7 | 40231525220204164 |
oct | 3646571035517455 |
9 | 578527672517511 |
10 | 134603343306541 |
11 | 39985a5921604a |
12 | 1311b0433b2491 |
13 | 5a1506b873cc5 |
14 | 2534b9d7d23db |
15 | 108651db7ac61 |
hex | 7a6bc8769f2d |
134603343306541 has 2 divisors, whose sum is σ = 134603343306542. Its totient is φ = 134603343306540.
The previous prime is 134603343306401. The next prime is 134603343306547. The reversal of 134603343306541 is 145603343306431.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84082095997641 + 50521247308900 = 9169629^2 + 7107830^2 .
It is a cyclic number.
It is not a de Polignac number, because 134603343306541 - 237 = 134465904353069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 134603343306491 and 134603343306500.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134603343306547) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67301671653270 + 67301671653271.
It is an arithmetic number, because the mean of its divisors is an integer number (67301671653271).
Almost surely, 2134603343306541 is an apocalyptic number.
It is an amenable number.
134603343306541 is a deficient number, since it is larger than the sum of its proper divisors (1).
134603343306541 is an equidigital number, since it uses as much as digits as its factorization.
134603343306541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2799360, while the sum is 46.
The spelling of 134603343306541 in words is "one hundred thirty-four trillion, six hundred three billion, three hundred forty-three million, three hundred six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •