Base | Representation |
---|---|
bin | 1100010110010110101101… |
… | …11010001111110101111100 |
3 | 10120011010101102121122010002 |
4 | 12023023112322033311330 |
5 | 12024412241020320110 |
6 | 133431250043133432 |
7 | 5501661426336365 |
oct | 613132672176574 |
9 | 116133342548102 |
10 | 27156388838780 |
11 | 871aa61596683 |
12 | 306710b814278 |
13 | 121cab498b896 |
14 | 69c53a550b6c |
15 | 3215eeea8aa5 |
hex | 18b2d6e8fd7c |
27156388838780 has 48 divisors (see below), whose sum is σ = 57154662845280. Its totient is φ = 10838510726400.
The previous prime is 27156388838771. The next prime is 27156388838783. The reversal of 27156388838780 is 8783888365172.
It is a junction number, because it is equal to n+sod(n) for n = 27156388838698 and 27156388838707.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27156388838783) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 266028950 + ... + 266131010.
It is an arithmetic number, because the mean of its divisors is an integer number (1190722142610).
Almost surely, 227156388838780 is an apocalyptic number.
27156388838780 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
27156388838780 is an abundant number, since it is smaller than the sum of its proper divisors (29998274006500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27156388838780 is a wasteful number, since it uses less digits than its factorization.
27156388838780 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131390 (or 131388 counting only the distinct ones).
The product of its (nonzero) digits is 867041280, while the sum is 74.
The spelling of 27156388838780 in words is "twenty-seven trillion, one hundred fifty-six billion, three hundred eighty-eight million, eight hundred thirty-eight thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •