Base | Representation |
---|---|
bin | 11110110000011100101100… |
… | …110101010000101010100101 |
3 | 122201221202102221122112110001 |
4 | 132300130230311100222211 |
5 | 120212233442232200132 |
6 | 1155410305013301301 |
7 | 40330663134224314 |
oct | 3660345465205245 |
9 | 581852387575401 |
10 | 135270747146917 |
11 | 3a113002299548 |
12 | 13208463634831 |
13 | 5a62c90b1bc15 |
14 | 25591d396a27b |
15 | 1098a81236ce7 |
hex | 7b072cd50aa5 |
135270747146917 has 2 divisors, whose sum is σ = 135270747146918. Its totient is φ = 135270747146916.
The previous prime is 135270747146897. The next prime is 135270747146921. The reversal of 135270747146917 is 719641747072531.
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., 130500327658276 + 4770419488641 = 11423674^2 + 2184129^2 .
It is a cyclic number.
It is not a de Polignac number, because 135270747146917 - 27 = 135270747146789 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135270747146947) 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, 67635373573458 + 67635373573459.
It is an arithmetic number, because the mean of its divisors is an integer number (67635373573459).
Almost surely, 2135270747146917 is an apocalyptic number.
It is an amenable number.
135270747146917 is a deficient number, since it is larger than the sum of its proper divisors (1).
135270747146917 is an equidigital number, since it uses as much as digits as its factorization.
135270747146917 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62233920, while the sum is 64.
The spelling of 135270747146917 in words is "one hundred thirty-five trillion, two hundred seventy billion, seven hundred forty-seven million, one hundred forty-six thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •