Base | Representation |
---|---|
bin | 11001100110100110… |
… | …010001101010100110 |
3 | 2121221220101021022000 |
4 | 121212212101222212 |
5 | 422300211114023 |
6 | 20343525550130 |
7 | 1662153416232 |
oct | 314646215246 |
9 | 77856337260 |
10 | 27491113638 |
11 | 1072802062a |
12 | 53b2875346 |
13 | 2791673c61 |
14 | 148b1635c2 |
15 | aad745243 |
hex | 666991aa6 |
27491113638 has 16 divisors (see below), whose sum is σ = 61091363760. Its totient is φ = 9163704528.
The previous prime is 27491113633. The next prime is 27491113669. The reversal of 27491113638 is 83631119472.
27491113638 is a `hidden beast` number, since 2 + 7 + 4 + 9 + 1 + 1 + 1 + 3 + 638 = 666.
It is a super-2 number, since 2×274911136382 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 27491113593 and 27491113602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27491113633) 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, 254547295 + ... + 254547402.
It is an arithmetic number, because the mean of its divisors is an integer number (3818210235).
Almost surely, 227491113638 is an apocalyptic number.
27491113638 is an abundant number, since it is smaller than the sum of its proper divisors (33600250122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27491113638 is a wasteful number, since it uses less digits than its factorization.
27491113638 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 509094708 (or 509094702 counting only the distinct ones).
The product of its digits is 217728, while the sum is 45.
The spelling of 27491113638 in words is "twenty-seven billion, four hundred ninety-one million, one hundred thirteen thousand, six hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •