Base | Representation |
---|---|
bin | 11001001100101010… |
… | …110001000001011000 |
3 | 2120211120210102111100 |
4 | 121030222301001120 |
5 | 420402324124112 |
6 | 20232425431400 |
7 | 1645321624356 |
oct | 311452610130 |
9 | 76746712440 |
10 | 27056083032 |
11 | 105244a9700 |
12 | 52b103b560 |
13 | 27224b89b4 |
14 | 14494807d6 |
15 | a854622dc |
hex | 64cab1058 |
27056083032 has 576 divisors, whose sum is σ = 90348410880. Its totient is φ = 7273728000.
The previous prime is 27056083013. The next prime is 27056083039. The reversal of 27056083032 is 23038065072.
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 (27056083039) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 325976863 + ... + 325976945.
It is an arithmetic number, because the mean of its divisors is an integer number (156854880).
Almost surely, 227056083032 is an apocalyptic number.
27056083032 is a gapful number since it is divisible by the number (22) 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 27056083032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45174205440).
27056083032 is an abundant number, since it is smaller than the sum of its proper divisors (63292327848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27056083032 is a wasteful number, since it uses less digits than its factorization.
27056083032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 236 (or 218 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 36.
The spelling of 27056083032 in words is "twenty-seven billion, fifty-six million, eighty-three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •