Base | Representation |
---|---|
bin | 1100100111111101000010… |
… | …10110000100011010111101 |
3 | 10122021221012102202100222022 |
4 | 12103332201112010122331 |
5 | 12114314143110113401 |
6 | 135013133033125525 |
7 | 5563446312154112 |
oct | 623764126043275 |
9 | 118257172670868 |
10 | 27761080551101 |
11 | 8933454272077 |
12 | 31443498598a5 |
13 | 1264b21637811 |
14 | 6bd901966909 |
15 | 3321e1b8371b |
hex | 193fa15846bd |
27761080551101 has 4 divisors (see below), whose sum is σ = 27803206622400. Its totient is φ = 27718954479804.
The previous prime is 27761080551089. The next prime is 27761080551131. The reversal of 27761080551101 is 10115508016772.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 27761080551101 - 218 = 27761080288957 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 (27761080551131) 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, 21063034661 + ... + 21063035978.
It is an arithmetic number, because the mean of its divisors is an integer number (6950801655600).
Almost surely, 227761080551101 is an apocalyptic number.
It is an amenable number.
27761080551101 is a deficient number, since it is larger than the sum of its proper divisors (42126071299).
27761080551101 is an equidigital number, since it uses as much as digits as its factorization.
27761080551101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42126071298.
The product of its (nonzero) digits is 117600, while the sum is 44.
Adding to 27761080551101 its reverse (10115508016772), we get a palindrome (37876588567873).
The spelling of 27761080551101 in words is "twenty-seven trillion, seven hundred sixty-one billion, eighty million, five hundred fifty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •