Base | Representation |
---|---|
bin | 11001111100110001… |
… | …110011000100000000 |
3 | 2122220211120212210000 |
4 | 121330301303010000 |
5 | 424030441422033 |
6 | 20444501440000 |
7 | 2004322366530 |
oct | 317461630400 |
9 | 78824525700 |
10 | 27863232768 |
11 | 108a90831a8 |
12 | 5497410000 |
13 | 28207a2ca7 |
14 | 14c474b4c0 |
15 | ad124ca13 |
hex | 67cc73100 |
27863232768 has 360 divisors, whose sum is σ = 95704495040. Its totient is φ = 7897927680.
The previous prime is 27863232767. The next prime is 27863232773. The reversal of 27863232768 is 86723236872.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a nude number because it is divisible by every one of its digits.
It is not an unprimeable number, because it can be changed into a prime (27863232767) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 20175438 + ... + 20176818.
Almost surely, 227863232768 is an apocalyptic number.
27863232768 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 27863232768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47852247520).
27863232768 is an abundant number, since it is smaller than the sum of its proper divisors (67841262272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27863232768 is a wasteful number, since it uses less digits than its factorization.
27863232768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1555 (or 1532 counting only the distinct ones).
The product of its digits is 8128512, while the sum is 54.
The spelling of 27863232768 in words is "twenty-seven billion, eight hundred sixty-three million, two hundred thirty-two thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •