Base | Representation |
---|---|
bin | 100101100000101011… |
… | …1100111100010001001 |
3 | 21200220220211010122101 |
4 | 1023001113213202021 |
5 | 2304433210332012 |
6 | 101001131153401 |
7 | 5551123230046 |
oct | 1130127474211 |
9 | 250826733571 |
10 | 80553605257 |
11 | 31187456994 |
12 | 137412a5861 |
13 | 7799a382a8 |
14 | 3c824c61cd |
15 | 2166dc4d57 |
hex | 12c15e7889 |
80553605257 has 4 divisors (see below), whose sum is σ = 80554274820. Its totient is φ = 80552935696.
The previous prime is 80553605213. The next prime is 80553605261. The reversal of 80553605257 is 75250635508.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 6430275721 + 74123329536 = 80189^2 + 272256^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-80553605257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (80553605287) 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 in 3 ways as a sum of consecutive naturals, for example, 98938 + ... + 413395.
It is an arithmetic number, because the mean of its divisors is an integer number (20138568705).
Almost surely, 280553605257 is an apocalyptic number.
It is an amenable number.
80553605257 is a deficient number, since it is larger than the sum of its proper divisors (669563).
80553605257 is a wasteful number, since it uses less digits than its factorization.
80553605257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 669562.
The product of its (nonzero) digits is 1260000, while the sum is 46.
The spelling of 80553605257 in words is "eighty billion, five hundred fifty-three million, six hundred five thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •