Base | Representation |
---|---|
bin | 100000010110000… |
… | …1100101100001001 |
3 | 2210122020101022102 |
4 | 1000230030230021 |
5 | 4210321000022 |
6 | 255410203145 |
7 | 35616064655 |
oct | 10054145411 |
9 | 2718211272 |
10 | 1085328137 |
11 | 507704103 |
12 | 2635834b5 |
13 | 143b147ca |
14 | a41dda65 |
15 | 65438a92 |
hex | 40b0cb09 |
1085328137 has 2 divisors, whose sum is σ = 1085328138. Its totient is φ = 1085328136.
The previous prime is 1085328121. The next prime is 1085328143. The reversal of 1085328137 is 7318235801.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1066414336 + 18913801 = 32656^2 + 4349^2 .
It is an emirp because it is prime and its reverse (7318235801) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1085328137 - 24 = 1085328121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1085328137.
It is not a weakly prime, because it can be changed into another prime (1085328107) 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 as a sum of consecutive naturals, namely, 542664068 + 542664069.
It is an arithmetic number, because the mean of its divisors is an integer number (542664069).
Almost surely, 21085328137 is an apocalyptic number.
It is an amenable number.
1085328137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1085328137 is an equidigital number, since it uses as much as digits as its factorization.
1085328137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40320, while the sum is 38.
The square root of 1085328137 is about 32944.3187363163. The cubic root of 1085328137 is about 1027.6700206256.
The spelling of 1085328137 in words is "one billion, eighty-five million, three hundred twenty-eight thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •