Base | Representation |
---|---|
bin | 11001100001110101… |
… | …111000111100100000 |
3 | 2121202100020100211121 |
4 | 121201311320330200 |
5 | 422114244224413 |
6 | 20331555422024 |
7 | 1660164244420 |
oct | 314165707440 |
9 | 77670210747 |
10 | 27411320608 |
11 | 10696a80981 |
12 | 538bbb4914 |
13 | 277ac86b49 |
14 | 1480712480 |
15 | aa6732b8d |
hex | 661d78f20 |
27411320608 has 192 divisors, whose sum is σ = 67833158400. Its totient is φ = 10631577600.
The previous prime is 27411320597. The next prime is 27411320617. The reversal of 27411320608 is 80602311472.
It is a Harshad number since it is a multiple of its sum of digits (34).
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 31 ways as a sum of consecutive naturals, for example, 44282923 + ... + 44283541.
It is an arithmetic number, because the mean of its divisors is an integer number (353297700).
Almost surely, 227411320608 is an apocalyptic number.
27411320608 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 27411320608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33916579200).
27411320608 is an abundant number, since it is smaller than the sum of its proper divisors (40421837792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27411320608 is a wasteful number, since it uses less digits than its factorization.
27411320608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1083 (or 1075 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 34.
The spelling of 27411320608 in words is "twenty-seven billion, four hundred eleven million, three hundred twenty thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •