Base | Representation |
---|---|
bin | 11110110000101001110100… |
… | …100010110010101000101101 |
3 | 122202000002210202202002112221 |
4 | 132300221310202302220231 |
5 | 120213001320300314030 |
6 | 1155420554552355341 |
7 | 40332002221350424 |
oct | 3660516442625055 |
9 | 582002722662487 |
10 | 135284835166765 |
11 | 3a118a81646359 |
12 | 1320b1356a5b51 |
13 | 5a643c773863b |
14 | 2559b6c9d62bb |
15 | 1099107e54e7a |
hex | 7b0a748b2a2d |
135284835166765 has 8 divisors (see below), whose sum is σ = 163859015305440. Its totient is φ = 107216392729872.
The previous prime is 135284835166751. The next prime is 135284835166801. The reversal of 135284835166765 is 567661538482531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 135284835166765 - 29 = 135284835166253 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135284835166694 and 135284835166703.
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 126434424855 + ... + 126434425924.
It is an arithmetic number, because the mean of its divisors is an integer number (20482376913180).
Almost surely, 2135284835166765 is an apocalyptic number.
It is an amenable number.
135284835166765 is a deficient number, since it is larger than the sum of its proper divisors (28574180138675).
135284835166765 is a wasteful number, since it uses less digits than its factorization.
135284835166765 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252868850891.
The product of its digits is 870912000, while the sum is 70.
The spelling of 135284835166765 in words is "one hundred thirty-five trillion, two hundred eighty-four billion, eight hundred thirty-five million, one hundred sixty-six thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •