Base | Representation |
---|---|
bin | 10000001000010… |
… | …10110101110001 |
3 | 100102121111101121 |
4 | 20010022311301 |
5 | 234114420310 |
6 | 21232102241 |
7 | 3232056565 |
oct | 1004126561 |
9 | 312544347 |
10 | 135310705 |
11 | 6a419a32 |
12 | 39394981 |
13 | 22057b0a |
14 | 13d836a5 |
15 | bd2c0da |
hex | 810ad71 |
135310705 has 8 divisors (see below), whose sum is σ = 164197800. Its totient is φ = 107031936.
The previous prime is 135310699. The next prime is 135310709. The reversal of 135310705 is 507013531.
It can be written as a sum of positive squares in 4 ways, for example, as 1468944 + 133841761 = 1212^2 + 11569^2 .
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 135310705 - 25 = 135310673 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 135310705.
It is not an unprimeable number, because it can be changed into a prime (135310709) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 151590 + ... + 152479.
It is an arithmetic number, because the mean of its divisors is an integer number (20524725).
Almost surely, 2135310705 is an apocalyptic number.
It is an amenable number.
135310705 is a deficient number, since it is larger than the sum of its proper divisors (28887095).
135310705 is an equidigital number, since it uses as much as digits as its factorization.
135310705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304163.
The product of its (nonzero) digits is 1575, while the sum is 25.
The square root of 135310705 is about 11632.3129686232. The cubic root of 135310705 is about 513.3860365952.
The spelling of 135310705 in words is "one hundred thirty-five million, three hundred ten thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •