Base | Representation |
---|---|
bin | 11001011101000111… |
… | …101100100101011010 |
3 | 2121112211011200000020 |
4 | 121131013230211122 |
5 | 421434004234430 |
6 | 20320045451310 |
7 | 1655213016000 |
oct | 313507544532 |
9 | 77484150006 |
10 | 27332102490 |
11 | 10656294160 |
12 | 5369570b36 |
13 | 276773b614 |
14 | 1473db0a70 |
15 | a9e7d5b10 |
hex | 65d1ec95a |
27332102490 has 512 divisors, whose sum is σ = 89579520000. Its totient is φ = 5275065600.
The previous prime is 27332102477. The next prime is 27332102503. The reversal of 27332102490 is 9420123372.
It is an interprime number because it is at equal distance from previous prime (27332102477) and next prime (27332102503).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 152693221 + ... + 152693399.
It is an arithmetic number, because the mean of its divisors is an integer number (174960000).
Almost surely, 227332102490 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27332102490, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44789760000).
27332102490 is an abundant number, since it is smaller than the sum of its proper divisors (62247417510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27332102490 is a wasteful number, since it uses less digits than its factorization.
27332102490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311 (or 297 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 33.
The spelling of 27332102490 in words is "twenty-seven billion, three hundred thirty-two million, one hundred two thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •