Base | Representation |
---|---|
bin | 11110100010110011101010… |
… | …000111101101100110111111 |
3 | 122121122010210101120110022011 |
4 | 132202303222013231212333 |
5 | 120101404122202240223 |
6 | 1153411513320232051 |
7 | 40203156010621402 |
oct | 3642635207554677 |
9 | 577563711513264 |
10 | 134333325040063 |
11 | 39891496a16a16 |
12 | 1309684690b627 |
13 | 59c57693b3126 |
14 | 2525aa6501d39 |
15 | 107e4b86d880d |
hex | 7a2cea1ed9bf |
134333325040063 has 2 divisors, whose sum is σ = 134333325040064. Its totient is φ = 134333325040062.
The previous prime is 134333325039961. The next prime is 134333325040067. The reversal of 134333325040063 is 360040523333431.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 134333325040063 - 233 = 134324735105471 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 134333325039998 and 134333325040025.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134333325040067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67166662520031 + 67166662520032.
It is an arithmetic number, because the mean of its divisors is an integer number (67166662520032).
Almost surely, 2134333325040063 is an apocalyptic number.
134333325040063 is a deficient number, since it is larger than the sum of its proper divisors (1).
134333325040063 is an equidigital number, since it uses as much as digits as its factorization.
134333325040063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 699840, while the sum is 40.
Adding to 134333325040063 its reverse (360040523333431), we get a palindrome (494373848373494).
The spelling of 134333325040063 in words is "one hundred thirty-four trillion, three hundred thirty-three billion, three hundred twenty-five million, forty thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •