Base | Representation |
---|---|
bin | 11001111001100000… |
… | …011101010110000000 |
3 | 2122210000022211121110 |
4 | 121321200131112000 |
5 | 423422414340322 |
6 | 20435221323320 |
7 | 2003055060234 |
oct | 317140352600 |
9 | 78700284543 |
10 | 27808355712 |
11 | 10880101265 |
12 | 5480b66540 |
13 | 28122caa67 |
14 | 14bb3445c4 |
15 | acb50cc0c |
hex | 67981d580 |
27808355712 has 128 divisors (see below), whose sum is σ = 77314498560. Its totient is φ = 8839176192.
The previous prime is 27808355699. The next prime is 27808355713. The reversal of 27808355712 is 21755380872.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27808355713) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2971713 + ... + 2981055.
It is an arithmetic number, because the mean of its divisors is an integer number (604019520).
Almost surely, 227808355712 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27808355712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38657249280).
27808355712 is an abundant number, since it is smaller than the sum of its proper divisors (49506142848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27808355712 is a wasteful number, since it uses less digits than its factorization.
27808355712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9720 (or 9708 counting only the distinct ones).
The product of its (nonzero) digits is 940800, while the sum is 48.
The spelling of 27808355712 in words is "twenty-seven billion, eight hundred eight million, three hundred fifty-five thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •