Base | Representation |
---|---|
bin | 10000000110101… |
… | …01011111000101 |
3 | 100102012101121112 |
4 | 20003111133011 |
5 | 234040422130 |
6 | 21223254405 |
7 | 3230156465 |
oct | 1003253705 |
9 | 312171545 |
10 | 135092165 |
11 | 6a28a81a |
12 | 392aa405 |
13 | 21cac4c0 |
14 | 13d27ba5 |
15 | bcd7495 |
hex | 80d57c5 |
135092165 has 8 divisors (see below), whose sum is σ = 174580728. Its totient is φ = 99760320.
The previous prime is 135092161. The next prime is 135092173. The reversal of 135092165 is 561290531.
It can be written as a sum of positive squares in 4 ways, for example, as 3806401 + 131285764 = 1951^2 + 11458^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 135092165 - 22 = 135092161 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135092161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1039106 + ... + 1039235.
It is an arithmetic number, because the mean of its divisors is an integer number (21822591).
Almost surely, 2135092165 is an apocalyptic number.
It is an amenable number.
135092165 is a deficient number, since it is larger than the sum of its proper divisors (39488563).
135092165 is a wasteful number, since it uses less digits than its factorization.
135092165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2078359.
The product of its (nonzero) digits is 8100, while the sum is 32.
The square root of 135092165 is about 11622.9155120391. The cubic root of 135092165 is about 513.1094981379.
The spelling of 135092165 in words is "one hundred thirty-five million, ninety-two thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •