Base | Representation |
---|---|
bin | 11001011101111010… |
… | …110101111100110000 |
3 | 2121120202101211220210 |
4 | 121131322311330300 |
5 | 422000422311232 |
6 | 20321245104120 |
7 | 1655435000340 |
oct | 313572657460 |
9 | 77522354823 |
10 | 27345510192 |
11 | 10662911600 |
12 | 5371b58040 |
13 | 276a454280 |
14 | 1475aa0d20 |
15 | aa0a835cc |
hex | 65deb5f30 |
27345510192 has 480 divisors, whose sum is σ = 98709237760. Its totient is φ = 6341068800.
The previous prime is 27345510173. The next prime is 27345510193. The reversal of 27345510192 is 29101554372.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 27345510192.
It is not an unprimeable number, because it can be changed into a prime (27345510193) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 16383534 + ... + 16385202.
Almost surely, 227345510192 is an apocalyptic number.
27345510192 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 27345510192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49354618880).
27345510192 is an abundant number, since it is smaller than the sum of its proper divisors (71363727568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27345510192 is a wasteful number, since it uses less digits than its factorization.
27345510192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1753 (or 1736 counting only the distinct ones).
The product of its (nonzero) digits is 75600, while the sum is 39.
The spelling of 27345510192 in words is "twenty-seven billion, three hundred forty-five million, five hundred ten thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •