Base | Representation |
---|---|
bin | 11001001100101001… |
… | …000101011101111000 |
3 | 2120211112222001011220 |
4 | 121030221011131320 |
5 | 420402221024423 |
6 | 20232412152040 |
7 | 1645315111110 |
oct | 311451053570 |
9 | 76745861156 |
10 | 27055642488 |
11 | 10524228716 |
12 | 52b0a68620 |
13 | 2722393314 |
14 | 14493a8040 |
15 | a853c69e3 |
hex | 64ca45778 |
27055642488 has 32 divisors (see below), whose sum is σ = 77301836160. Its totient is φ = 7730183520.
The previous prime is 27055642469. The next prime is 27055642489. The reversal of 27055642488 is 88424655072.
It is a self number, because there is not a number n which added to its sum of digits gives 27055642488.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27055642489) 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, 80522578 + ... + 80522913.
It is an arithmetic number, because the mean of its divisors is an integer number (2415682380).
Almost surely, 227055642488 is an apocalyptic number.
27055642488 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
27055642488 is an abundant number, since it is smaller than the sum of its proper divisors (50246193672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27055642488 is a wasteful number, since it uses less digits than its factorization.
27055642488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161045507 (or 161045503 counting only the distinct ones).
The product of its (nonzero) digits is 4300800, while the sum is 51.
The spelling of 27055642488 in words is "twenty-seven billion, fifty-five million, six hundred forty-two thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •