Base | Representation |
---|---|
bin | 100101100011010101… |
… | …1101100110110111111 |
3 | 21201011010120110111220 |
4 | 1023012223230312333 |
5 | 2310124021143111 |
6 | 101014034044423 |
7 | 5553255054615 |
oct | 1130653546677 |
9 | 251133513456 |
10 | 80642756031 |
11 | 31222808212 |
12 | 13767119713 |
13 | 77b2350826 |
14 | 3c902916b5 |
15 | 216eb34e06 |
hex | 12c6aecdbf |
80642756031 has 8 divisors (see below), whose sum is σ = 107537233200. Its totient is φ = 53755058112.
The previous prime is 80642756021. The next prime is 80642756041. The reversal of 80642756031 is 13065724608.
It is an interprime number because it is at equal distance from previous prime (80642756021) and next prime (80642756041).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 80642756031 - 29 = 80642755519 is a prime.
It is a super-3 number, since 3×806427560313 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80642756011) 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 in 7 ways as a sum of consecutive naturals, for example, 1666990 + ... + 1714683.
It is an arithmetic number, because the mean of its divisors is an integer number (13442154150).
Almost surely, 280642756031 is an apocalyptic number.
80642756031 is a deficient number, since it is larger than the sum of its proper divisors (26894477169).
80642756031 is a wasteful number, since it uses less digits than its factorization.
80642756031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3389625.
The product of its (nonzero) digits is 241920, while the sum is 42.
The spelling of 80642756031 in words is "eighty billion, six hundred forty-two million, seven hundred fifty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •