Base | Representation |
---|---|
bin | 11110100011010010001101… |
… | …000110000011101001101101 |
3 | 122121202021110012201110210002 |
4 | 132203102031012003221231 |
5 | 120102423310230011331 |
6 | 1153434540101154045 |
7 | 40205426546000102 |
oct | 3643221506035155 |
9 | 577667405643702 |
10 | 134366124063341 |
11 | 398a4398130625 |
12 | 130a107b0bb925 |
13 | 59c8895622a01 |
14 | 25274d8598aa9 |
15 | 1080287e079cb |
hex | 7a348d183a6d |
134366124063341 has 2 divisors, whose sum is σ = 134366124063342. Its totient is φ = 134366124063340.
The previous prime is 134366124063319. The next prime is 134366124063407. The reversal of 134366124063341 is 143360421663431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 76705261487716 + 57660862575625 = 8758154^2 + 7593475^2 .
It is a cyclic number.
It is not a de Polignac number, because 134366124063341 - 218 = 134366123801197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134366124063641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67183062031670 + 67183062031671.
It is an arithmetic number, because the mean of its divisors is an integer number (67183062031671).
Almost surely, 2134366124063341 is an apocalyptic number.
It is an amenable number.
134366124063341 is a deficient number, since it is larger than the sum of its proper divisors (1).
134366124063341 is an equidigital number, since it uses as much as digits as its factorization.
134366124063341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2239488, while the sum is 47.
The spelling of 134366124063341 in words is "one hundred thirty-four trillion, three hundred sixty-six billion, one hundred twenty-four million, sixty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •