Base | Representation |
---|---|
bin | 11001100110101100… |
… | …010000010101011000 |
3 | 2121222000022220101020 |
4 | 121212230100111120 |
5 | 422301111243143 |
6 | 20344023322440 |
7 | 1662202635030 |
oct | 314654202530 |
9 | 77860286336 |
10 | 27492681048 |
11 | 107289a1208 |
12 | 53b32b0420 |
13 | 2791aa2511 |
14 | 148b4508c0 |
15 | aad954883 |
hex | 666b10558 |
27492681048 has 96 divisors (see below), whose sum is σ = 79137139200. Its totient is φ = 7796821248.
The previous prime is 27492681023. The next prime is 27492681053. The reversal of 27492681048 is 84018629472.
It is a super-2 number, since 2×274926810482 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3148833 + ... + 3157551.
It is an arithmetic number, because the mean of its divisors is an integer number (824345200).
Almost surely, 227492681048 is an apocalyptic number.
27492681048 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27492681048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39568569600).
27492681048 is an abundant number, since it is smaller than the sum of its proper divisors (51644458152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27492681048 is a wasteful number, since it uses less digits than its factorization.
27492681048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9009 (or 8868 counting only the distinct ones).
The product of its (nonzero) digits is 1548288, while the sum is 51.
The spelling of 27492681048 in words is "twenty-seven billion, four hundred ninety-two million, six hundred eighty-one thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •