Base | Representation |
---|---|
bin | 10010010111010011110101… |
… | …011110101111100011111101 |
3 | 101120222012221001010202122221 |
4 | 102113103311132233203331 |
5 | 41041240131434323122 |
6 | 443435411401005341 |
7 | 23004125465334436 |
oct | 2227236536574375 |
9 | 346865831122587 |
10 | 80766683511037 |
11 | 23809a5a293637 |
12 | 908515aa83851 |
13 | 360b35b6101a4 |
14 | 15d31b224248d |
15 | 950dd7d936c7 |
hex | 4974f57af8fd |
80766683511037 has 4 divisors (see below), whose sum is σ = 80799342908380. Its totient is φ = 80734024113696.
The previous prime is 80766683510927. The next prime is 80766683511047. The reversal of 80766683511037 is 73011538666708.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 58373099172441 + 22393584338596 = 7640229^2 + 4732186^2 .
It is a cyclic number.
It is not a de Polignac number, because 80766683511037 - 211 = 80766683508989 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80766683511047) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16329694962 + ... + 16329699907.
It is an arithmetic number, because the mean of its divisors is an integer number (20199835727095).
Almost surely, 280766683511037 is an apocalyptic number.
It is an amenable number.
80766683511037 is a deficient number, since it is larger than the sum of its proper divisors (32659397343).
80766683511037 is a wasteful number, since it uses less digits than its factorization.
80766683511037 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32659397342.
The product of its (nonzero) digits is 30481920, while the sum is 61.
The spelling of 80766683511037 in words is "eighty trillion, seven hundred sixty-six billion, six hundred eighty-three million, five hundred eleven thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •