Base | Representation |
---|---|
bin | 11001011100111000… |
… | …100001110101110000 |
3 | 2121112112200122201200 |
4 | 121130320201311300 |
5 | 421432000020240 |
6 | 20315424331200 |
7 | 1655134145445 |
oct | 313470416560 |
9 | 77475618650 |
10 | 27328126320 |
11 | 10654018870 |
12 | 5368173b00 |
13 | 2766978861 |
14 | 14736579cc |
15 | a9e29c930 |
hex | 65ce21d70 |
27328126320 has 120 divisors (see below), whose sum is σ = 100120346352. Its totient is φ = 6624998400.
The previous prime is 27328126289. The next prime is 27328126321. The reversal of 27328126320 is 2362182372.
27328126320 is a `hidden beast` number, since 2 + 7 + 3 + 2 + 8 + 12 + 632 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27328126321) 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 23 ways as a sum of consecutive naturals, for example, 1717341 + ... + 1733180.
Almost surely, 227328126320 is an apocalyptic number.
27328126320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
27328126320 is an abundant number, since it is smaller than the sum of its proper divisors (72792220032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27328126320 is a wasteful number, since it uses less digits than its factorization.
27328126320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3450551 (or 3450542 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The spelling of 27328126320 in words is "twenty-seven billion, three hundred twenty-eight million, one hundred twenty-six thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •