Base | Representation |
---|---|
bin | 11110011110011010011001… |
… | …011110011011100101100101 |
3 | 122120120021021102221211202222 |
4 | 132132122121132123211211 |
5 | 120031432123012032331 |
6 | 1153021050153042125 |
7 | 40142305110140054 |
oct | 3636323136334545 |
9 | 576507242854688 |
10 | 134031324330341 |
11 | 39785402438909 |
12 | 130482033b6345 |
13 | 59a313ac1c119 |
14 | 251521779c39b |
15 | 10766e0576b7b |
hex | 79e69979b965 |
134031324330341 has 2 divisors, whose sum is σ = 134031324330342. Its totient is φ = 134031324330340.
The previous prime is 134031324330313. The next prime is 134031324330383. The reversal of 134031324330341 is 143033423130431.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83078138907841 + 50953185422500 = 9114721^2 + 7138150^2 .
It is a cyclic number.
It is not a de Polignac number, because 134031324330341 - 218 = 134031324068197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134031324330311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67015662165170 + 67015662165171.
It is an arithmetic number, because the mean of its divisors is an integer number (67015662165171).
Almost surely, 2134031324330341 is an apocalyptic number.
It is an amenable number.
134031324330341 is a deficient number, since it is larger than the sum of its proper divisors (1).
134031324330341 is an equidigital number, since it uses as much as digits as its factorization.
134031324330341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 93312, while the sum is 35.
Adding to 134031324330341 its reverse (143033423130431), we get a palindrome (277064747460772).
The spelling of 134031324330341 in words is "one hundred thirty-four trillion, thirty-one billion, three hundred twenty-four million, three hundred thirty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •