Base | Representation |
---|---|
bin | 111110111111111000… |
… | …1111110010000010001 |
3 | 110221012102211221111022 |
4 | 1331333301332100101 |
5 | 4204032133331112 |
6 | 142052250525225 |
7 | 12526362156323 |
oct | 1757761762021 |
9 | 427172757438 |
10 | 135287792657 |
11 | 52414483006 |
12 | 22277736815 |
13 | c9b0548a24 |
14 | 6795883613 |
15 | 37bc1b6d72 |
hex | 1f7fc7e411 |
135287792657 has 2 divisors, whose sum is σ = 135287792658. Its totient is φ = 135287792656.
The previous prime is 135287792611. The next prime is 135287792659. The reversal of 135287792657 is 756297782531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122863569361 + 12424223296 = 350519^2 + 111464^2 .
It is a cyclic number.
It is not a de Polignac number, because 135287792657 - 28 = 135287792401 is a prime.
Together with 135287792659, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 135287792657.
It is not a weakly prime, because it can be changed into another prime (135287792659) 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, 67643896328 + 67643896329.
It is an arithmetic number, because the mean of its divisors is an integer number (67643896329).
Almost surely, 2135287792657 is an apocalyptic number.
It is an amenable number.
135287792657 is a deficient number, since it is larger than the sum of its proper divisors (1).
135287792657 is an equidigital number, since it uses as much as digits as its factorization.
135287792657 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 44452800, while the sum is 62.
The spelling of 135287792657 in words is "one hundred thirty-five billion, two hundred eighty-seven million, seven hundred ninety-two thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •