Base | Representation |
---|---|
bin | 11110100111110111110001… |
… | …101100110101010101100101 |
3 | 122122212102002110200222020111 |
4 | 132213313301230311111211 |
5 | 120123104343202000113 |
6 | 1154235431110333021 |
7 | 40240256162014606 |
oct | 3647676154652545 |
9 | 578772073628214 |
10 | 134681344562533 |
11 | 39a0604596317a |
12 | 1313219195a171 |
13 | 5a1c51c881352 |
14 | 253887cd1bdad |
15 | 108858693413d |
hex | 7a7df1b35565 |
134681344562533 has 2 divisors, whose sum is σ = 134681344562534. Its totient is φ = 134681344562532.
The previous prime is 134681344562489. The next prime is 134681344562561. The reversal of 134681344562533 is 335265443186431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77112599578884 + 57568744983649 = 8781378^2 + 7587407^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134681344562533 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134681344562563) 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, 67340672281266 + 67340672281267.
It is an arithmetic number, because the mean of its divisors is an integer number (67340672281267).
Almost surely, 2134681344562533 is an apocalyptic number.
It is an amenable number.
134681344562533 is a deficient number, since it is larger than the sum of its proper divisors (1).
134681344562533 is an equidigital number, since it uses as much as digits as its factorization.
134681344562533 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 74649600, while the sum is 58.
The spelling of 134681344562533 in words is "one hundred thirty-four trillion, six hundred eighty-one billion, three hundred forty-four million, five hundred sixty-two thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •