Base | Representation |
---|---|
bin | 100101101100101010… |
… | …0000111000011110001 |
3 | 21201221220202022201122 |
4 | 1023121110013003301 |
5 | 2311244031321433 |
6 | 101105041512025 |
7 | 5564102012324 |
oct | 1133124070361 |
9 | 251856668648 |
10 | 80955338993 |
11 | 313731a6441 |
12 | 13833942615 |
13 | 7832035a69 |
14 | 3cbd9bc7bb |
15 | 218c2cc198 |
hex | 12d95070f1 |
80955338993 has 2 divisors, whose sum is σ = 80955338994. Its totient is φ = 80955338992.
The previous prime is 80955338939. The next prime is 80955339037. The reversal of 80955338993 is 39983355908.
Together with previous prime (80955338939) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 71164632289 + 9790706704 = 266767^2 + 98948^2 .
It is a cyclic number.
It is not a de Polignac number, because 80955338993 - 222 = 80951144689 is a prime.
It is a super-2 number, since 2×809553389932 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (80955338693) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40477669496 + 40477669497.
It is an arithmetic number, because the mean of its divisors is an integer number (40477669497).
Almost surely, 280955338993 is an apocalyptic number.
It is an amenable number.
80955338993 is a deficient number, since it is larger than the sum of its proper divisors (1).
80955338993 is an equidigital number, since it uses as much as digits as its factorization.
80955338993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31492800, while the sum is 62.
The spelling of 80955338993 in words is "eighty billion, nine hundred fifty-five million, three hundred thirty-eight thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •