Base | Representation |
---|---|
bin | 100101010100001111… |
… | …1011011000001101101 |
3 | 21122211211102210210002 |
4 | 1022220133123001231 |
5 | 2303104333031111 |
6 | 100451501154045 |
7 | 5534564431511 |
oct | 1125037330155 |
9 | 248754383702 |
10 | 80136220781 |
11 | 30a92897841 |
12 | 1364555b925 |
13 | 773141ac26 |
14 | 3c42cb8141 |
15 | 214042a63b |
hex | 12a87db06d |
80136220781 has 2 divisors, whose sum is σ = 80136220782. Its totient is φ = 80136220780.
The previous prime is 80136220741. The next prime is 80136220793. The reversal of 80136220781 is 18702263108.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79936252900 + 199967881 = 282730^2 + 14141^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-80136220781 is a prime.
It is a super-2 number, since 2×801362207812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (80136220721) 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, 40068110390 + 40068110391.
It is an arithmetic number, because the mean of its divisors is an integer number (40068110391).
Almost surely, 280136220781 is an apocalyptic number.
It is an amenable number.
80136220781 is a deficient number, since it is larger than the sum of its proper divisors (1).
80136220781 is an equidigital number, since it uses as much as digits as its factorization.
80136220781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32256, while the sum is 38.
Adding to 80136220781 its reverse (18702263108), we get a palindrome (98838483889).
The spelling of 80136220781 in words is "eighty billion, one hundred thirty-six million, two hundred twenty thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •