Base | Representation |
---|---|
bin | 11001010010111100… |
… | …001100101011110000 |
3 | 2121002220210211002122 |
4 | 121102330030223300 |
5 | 421111244103310 |
6 | 20251105133412 |
7 | 1651040243303 |
oct | 312274145360 |
9 | 77086724078 |
10 | 27161316080 |
11 | 10578944868 |
12 | 532032a268 |
13 | 273b242382 |
14 | 1459434b3a |
15 | a8e7ec555 |
hex | 652f0caf0 |
27161316080 has 40 divisors (see below), whose sum is σ = 63160020000. Its totient is φ = 10862812928.
The previous prime is 27161316067. The next prime is 27161316089. The reversal of 27161316080 is 8061316172.
It is a tau number, because it is divible by the number of its divisors (40).
It is a self number, because there is not a number n which added to its sum of digits gives 27161316080.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27161316089) 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, 564821 + ... + 611019.
It is an arithmetic number, because the mean of its divisors is an integer number (1579000500).
Almost surely, 227161316080 is an apocalyptic number.
27161316080 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
27161316080 is an abundant number, since it is smaller than the sum of its proper divisors (35998703920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27161316080 is a wasteful number, since it uses less digits than its factorization.
27161316080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53561 (or 53555 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 35.
The spelling of 27161316080 in words is "twenty-seven billion, one hundred sixty-one million, three hundred sixteen thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •