Base | Representation |
---|---|
bin | 11110110000010111011010… |
… | …101000101101111111001001 |
3 | 122201221012210112001010211112 |
4 | 132300113122220231333021 |
5 | 120212140332212111022 |
6 | 1155403530004140105 |
7 | 40330402416150644 |
oct | 3660273250557711 |
9 | 581835715033745 |
10 | 135265073160137 |
11 | 3a11066049a278 |
12 | 1320733b397635 |
13 | 5a6259845b3ab |
14 | 2558c16182a5b |
15 | 109884d04a8e2 |
hex | 7b05daa2dfc9 |
135265073160137 has 4 divisors (see below), whose sum is σ = 138564221286036. Its totient is φ = 131965925034240.
The previous prime is 135265073160073. The next prime is 135265073160199. The reversal of 135265073160137 is 731061370562531.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 64880624632201 + 70384448527936 = 8054851^2 + 8389544^2 .
It is a cyclic number.
It is not a de Polignac number, because 135265073160137 - 26 = 135265073160073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135265073166137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1649574062888 + ... + 1649574062969.
It is an arithmetic number, because the mean of its divisors is an integer number (34641055321509).
Almost surely, 2135265073160137 is an apocalyptic number.
It is an amenable number.
135265073160137 is a deficient number, since it is larger than the sum of its proper divisors (3299148125899).
135265073160137 is an equidigital number, since it uses as much as digits as its factorization.
135265073160137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3299148125898.
The product of its (nonzero) digits is 2381400, while the sum is 50.
The spelling of 135265073160137 in words is "one hundred thirty-five trillion, two hundred sixty-five billion, seventy-three million, one hundred sixty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •