Base | Representation |
---|---|
bin | 1100100000100000000111… |
… | …00011111001011000010100 |
3 | 10121101110021212001011220020 |
4 | 12100100003203321120110 |
5 | 12101120300224232200 |
6 | 134255345251505140 |
7 | 5536113202035552 |
oct | 620200343713024 |
9 | 117343255034806 |
10 | 27505030305300 |
11 | 88448aa609689 |
12 | 31027aabb81b0 |
13 | 1246936c69932 |
14 | 6b13717c6bd2 |
15 | 32a707b08ea0 |
hex | 1904038f9614 |
27505030305300 has 36 divisors (see below), whose sum is σ = 79581221017536. Its totient is φ = 7334674748000.
The previous prime is 27505030305289. The next prime is 27505030305371. The reversal of 27505030305300 is 350303050572.
It is a super-2 number, since 2×275050303053002 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 45841716876 + ... + 45841717475.
Almost surely, 227505030305300 is an apocalyptic number.
27505030305300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
27505030305300 is an abundant number, since it is smaller than the sum of its proper divisors (52076190712236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27505030305300 is a wasteful number, since it uses less digits than its factorization.
27505030305300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91683434368 (or 91683434361 counting only the distinct ones).
The product of its (nonzero) digits is 47250, while the sum is 33.
Adding to 27505030305300 its reverse (350303050572), we get a palindrome (27855333355872).
The spelling of 27505030305300 in words is "twenty-seven trillion, five hundred five billion, thirty million, three hundred five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •