Base | Representation |
---|---|
bin | 100010000100111111… |
… | …110101010000101101 |
3 | 10111110002112122120122 |
4 | 202010333311100231 |
5 | 1044414303022414 |
6 | 24450521254325 |
7 | 2433521625125 |
oct | 420477652055 |
9 | 114402478518 |
10 | 36591064109 |
11 | 1457777a056 |
12 | 71123343a5 |
13 | 35b1a4b332 |
14 | 1ab1955c85 |
15 | e425b6b8e |
hex | 884ff542d |
36591064109 has 2 divisors, whose sum is σ = 36591064110. Its totient is φ = 36591064108.
The previous prime is 36591064051. The next prime is 36591064121. The reversal of 36591064109 is 90146019563.
36591064109 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19264607209 + 17326456900 = 138797^2 + 131630^2 .
It is an emirp because it is prime and its reverse (90146019563) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 36591064109 - 212 = 36591060013 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 36591064109.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (36591064189) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 18295532054 + 18295532055.
It is an arithmetic number, because the mean of its divisors is an integer number (18295532055).
Almost surely, 236591064109 is an apocalyptic number.
It is an amenable number.
36591064109 is a deficient number, since it is larger than the sum of its proper divisors (1).
36591064109 is an equidigital number, since it uses as much as digits as its factorization.
36591064109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 174960, while the sum is 44.
The spelling of 36591064109 in words is "thirty-six billion, five hundred ninety-one million, sixty-four thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •