Base | Representation |
---|---|
bin | 11001011111011101… |
… | …010101000101000000 |
3 | 2121122112222112000210 |
4 | 121133131111011000 |
5 | 422024024442213 |
6 | 20324010314120 |
7 | 1656200306346 |
oct | 313735250500 |
9 | 77575875023 |
10 | 27371327808 |
11 | 10676445780 |
12 | 537a728940 |
13 | 27728c3676 |
14 | 14792a1996 |
15 | aa2e830c3 |
hex | 65f755140 |
27371327808 has 112 divisors (see below), whose sum is σ = 80086297536. Its totient is φ = 8180674560.
The previous prime is 27371327783. The next prime is 27371327831. The reversal of 27371327808 is 80872317372.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 65410 + ... + 242942.
It is an arithmetic number, because the mean of its divisors is an integer number (715056228).
Almost surely, 227371327808 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 27371327808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40043148768).
27371327808 is an abundant number, since it is smaller than the sum of its proper divisors (52714969728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27371327808 is a wasteful number, since it uses less digits than its factorization.
27371327808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177632 (or 177622 counting only the distinct ones).
The product of its (nonzero) digits is 790272, while the sum is 48.
The spelling of 27371327808 in words is "twenty-seven billion, three hundred seventy-one million, three hundred twenty-seven thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •