Base | Representation |
---|---|
bin | 100101011100110110… |
… | …1011110011010111101 |
3 | 21200120222001021101212 |
4 | 1022321231132122331 |
5 | 2304202312223443 |
6 | 100540301214205 |
7 | 5545003134566 |
oct | 1127155363275 |
9 | 250528037355 |
10 | 80425117373 |
11 | 31120978057 |
12 | 13706261365 |
13 | 777922bb63 |
14 | 3c6d3db16d |
15 | 215a994618 |
hex | 12b9b5e6bd |
80425117373 has 2 divisors, whose sum is σ = 80425117374. Its totient is φ = 80425117372.
The previous prime is 80425117319. The next prime is 80425117411. The reversal of 80425117373 is 37371152408.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61344391684 + 19080725689 = 247678^2 + 138133^2 .
It is a cyclic number.
It is not a de Polignac number, because 80425117373 - 212 = 80425113277 is a prime.
It is a super-2 number, since 2×804251173732 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 80425117373.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (80425117273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 40212558686 + 40212558687.
It is an arithmetic number, because the mean of its divisors is an integer number (40212558687).
Almost surely, 280425117373 is an apocalyptic number.
It is an amenable number.
80425117373 is a deficient number, since it is larger than the sum of its proper divisors (1).
80425117373 is an equidigital number, since it uses as much as digits as its factorization.
80425117373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 141120, while the sum is 41.
The spelling of 80425117373 in words is "eighty billion, four hundred twenty-five million, one hundred seventeen thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •