Search a number
-
+
27011642000 = 2453721012729
BaseRepresentation
bin11001001010000001…
…001111001010010000
32120201111011120212012
4121022001033022100
5420304440021000
620224201122052
71644242111600
oct311201171220
976644146765
1027011642000
1110501405482
12529a189328
132716228925
1414435d2c00
15a815d4735
hex64a04f290

27011642000 has 240 divisors, whose sum is σ = 76758055920. Its totient is φ = 9166080000.

The previous prime is 27011641967. The next prime is 27011642027. The reversal of 27011642000 is 24611072.

It can be written as a sum of positive squares in 8 ways, for example, as 6635776 + 27005006224 = 2576^2 + 164332^2 .

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9896636 + ... + 9899364.

It is an arithmetic number, because the mean of its divisors is an integer number (319825233).

Almost surely, 227011642000 is an apocalyptic number.

27011642000 is a gapful number since it is divisible by the number (20) 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 27011642000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38379027960).

27011642000 is an abundant number, since it is smaller than the sum of its proper divisors (49746413920).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

27011642000 is a wasteful number, since it uses less digits than its factorization.

27011642000 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 2867 (or 2844 counting only the distinct ones).

The product of its (nonzero) digits is 672, while the sum is 23.

The spelling of 27011642000 in words is "twenty-seven billion, eleven million, six hundred forty-two thousand".