Base | Representation |
---|---|
bin | 100101100110000100… |
… | …1000101010111101001 |
3 | 21201101111220122112010 |
4 | 1023030021011113221 |
5 | 2310320443012211 |
6 | 101031105110133 |
7 | 5555446415124 |
oct | 1131411052751 |
9 | 251344818463 |
10 | 80734344681 |
11 | 3126a484111 |
12 | 13791928349 |
13 | 77c830a8b3 |
14 | 3c9c4d33bb |
15 | 2177bc74a6 |
hex | 12cc2455e9 |
80734344681 has 8 divisors (see below), whose sum is σ = 108043010944. Its totient is φ = 53624287440.
The previous prime is 80734344679. The next prime is 80734344701. The reversal of 80734344681 is 18644343708.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 80734344681 - 21 = 80734344679 is a prime.
It is a super-2 number, since 2×807343446812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 80734344681.
It is not an unprimeable number, because it can be changed into a prime (80734344661) 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 7 ways as a sum of consecutive naturals, for example, 49651306 + ... + 49652931.
It is an arithmetic number, because the mean of its divisors is an integer number (13505376368).
Almost surely, 280734344681 is an apocalyptic number.
It is an amenable number.
80734344681 is a deficient number, since it is larger than the sum of its proper divisors (27308666263).
80734344681 is a wasteful number, since it uses less digits than its factorization.
80734344681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99304511.
The product of its (nonzero) digits is 1548288, while the sum is 48.
The spelling of 80734344681 in words is "eighty billion, seven hundred thirty-four million, three hundred forty-four thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •