Search a number
-
+
27661067070 = 23571323601733
BaseRepresentation
bin11001110000101110…
…100110001100111110
32122101202011210120120
4121300232212030332
5423122213121240
620412440355410
71666316122260
oct316056461476
978352153516
1027661067070
1110804a5110a
12543b775b66
1327ba93b010
1414a5963b30
15abd616ad0
hex670ba633e

27661067070 has 256 divisors, whose sum is σ = 85517365248. Its totient is φ = 5565542400.

The previous prime is 27661067009. The next prime is 27661067087. The reversal of 27661067070 is 7076016672.

It is a Harshad number since it is a multiple of its sum of digits (42).

It is a congruent number.

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 127 ways as a sum of consecutive naturals, for example, 37736424 + ... + 37737156.

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

Almost surely, 227661067070 is an apocalyptic number.

It is a practical number, because each smaller number is the sum of distinct divisors of 27661067070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42758682624).

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

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

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

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

The sum of its prime factors is 1387.

The product of its (nonzero) digits is 148176, while the sum is 42.

The spelling of 27661067070 in words is "twenty-seven billion, six hundred sixty-one million, sixty-seven thousand, seventy".