Search a number
-
+
27204863000 = 23537113163211
BaseRepresentation
bin11001010101100010…
…010100010000011000
32121012221202020020112
4121111202110100120
5421203421104000
620255302343452
71652106343250
oct312542242030
977187666215
1027204863000
11105a0488257
125332a2ab88
13274727b493
14146112c960
15a93550235
hex655894418

27204863000 has 256 divisors, whose sum is σ = 74197693440. Its totient is φ = 9144576000.

The previous prime is 27204862999. The next prime is 27204863017. The reversal of 27204863000 is 36840272.

It is a super-3 number, since 3×272048630003 (a number of 32 digits) contains 333 as substring.

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 63 ways as a sum of consecutive naturals, for example, 128932895 + ... + 128933105.

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

Almost surely, 227204863000 is an apocalyptic number.

27204863000 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 27204863000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37098846720).

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

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

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

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

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

The product of its (nonzero) digits is 16128, while the sum is 32.

The spelling of 27204863000 in words is "twenty-seven billion, two hundred four million, eight hundred sixty-three thousand".