Base | Representation |
---|---|
bin | 100101110000011100… |
… | …1101101101110000101 |
3 | 21202021210021202000122 |
4 | 1023200321231232011 |
5 | 2312024123342224 |
6 | 101125430151325 |
7 | 5600206021151 |
oct | 1134071555605 |
9 | 252253252018 |
10 | 81082637189 |
11 | 31429042464 |
12 | 1386a4b2545 |
13 | 7852516838 |
14 | 3cd2878061 |
15 | 219857515e |
hex | 12e0e6db85 |
81082637189 has 2 divisors, whose sum is σ = 81082637190. Its totient is φ = 81082637188.
The previous prime is 81082637143. The next prime is 81082637213. The reversal of 81082637189 is 98173628018.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 41229302500 + 39853334689 = 203050^2 + 199633^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-81082637189 is a prime.
It is a super-3 number, since 3×810826371893 (a number of 34 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 81082637189.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (81082637989) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40541318594 + 40541318595.
It is an arithmetic number, because the mean of its divisors is an integer number (40541318595).
Almost surely, 281082637189 is an apocalyptic number.
It is an amenable number.
81082637189 is a deficient number, since it is larger than the sum of its proper divisors (1).
81082637189 is an equidigital number, since it uses as much as digits as its factorization.
81082637189 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1161216, while the sum is 53.
The spelling of 81082637189 in words is "eighty-one billion, eighty-two million, six hundred thirty-seven thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •