Base | Representation |
---|---|
bin | 11001011100011000… |
… | …010011110000000000 |
3 | 2121111221210112120000 |
4 | 121130120103300000 |
5 | 421422314230000 |
6 | 20314523320000 |
7 | 1655002306554 |
oct | 313430236000 |
9 | 77457715500 |
10 | 27319680000 |
11 | 1064a279a38 |
12 | 5365380000 |
13 | 2764cac232 |
14 | 1472499864 |
15 | a9d680000 |
hex | 65c613c00 |
27319680000 has 1100 divisors, whose sum is σ = 111423483072. Its totient is φ = 6635520000.
The previous prime is 27319679977. The next prime is 27319680001. The reversal of 27319680000 is 8691372.
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 (27319680001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 99 ways as a sum of consecutive naturals, for example, 881279985 + ... + 881280015.
Almost surely, 227319680000 is an apocalyptic number.
27319680000 is a gapful number since it is divisible by the number (20) 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 27319680000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55711741536).
27319680000 is an abundant number, since it is smaller than the sum of its proper divisors (84103803072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27319680000 is an equidigital number, since it uses as much as digits as its factorization.
27319680000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100 (or 58 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The spelling of 27319680000 in words is "twenty-seven billion, three hundred nineteen million, six hundred eighty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.776 sec. • engine limits •