Base | Representation |
---|---|
bin | 11001110111011100… |
… | …110010110010000000 |
3 | 2122200121101021122201 |
4 | 121313130302302000 |
5 | 423340100344022 |
6 | 20431545442544 |
7 | 2002155514645 |
oct | 316734626200 |
9 | 78617337581 |
10 | 27773840512 |
11 | 10862677500 |
12 | 54714a0454 |
13 | 2808104872 |
14 | 14b691bdcc |
15 | ac8491127 |
hex | 677732c80 |
27773840512 has 96 divisors (see below), whose sum is σ = 60984732060. Its totient is φ = 12589885440.
The previous prime is 27773840489. The next prime is 27773840527. The reversal of 27773840512 is 21504837772.
It can be written as a sum of positive squares in 2 ways, for example, as 25735859776 + 2037980736 = 160424^2 + 45144^2 .
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, 6146478 + ... + 6150994.
Almost surely, 227773840512 is an apocalyptic number.
27773840512 is a gapful number since it is divisible by the number (22) 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 27773840512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30492366030).
27773840512 is an abundant number, since it is smaller than the sum of its proper divisors (33210891548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27773840512 is a wasteful number, since it uses less digits than its factorization.
27773840512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4950 (or 4927 counting only the distinct ones).
The product of its (nonzero) digits is 658560, while the sum is 46.
The spelling of 27773840512 in words is "twenty-seven billion, seven hundred seventy-three million, eight hundred forty thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •