Search a number
-
+
51011040270 = 2356725378627
BaseRepresentation
bin101111100000011111…
…101011010000001110
311212200001021100010210
4233200133223100032
51313432311242040
635233435343250
73454046455011
oct574037532016
9155601240123
1051011040270
111a6a7447623
129a775b1b26
134a6c3740c8
14267cb13378
1514d8507480
hexbe07eb40e

51011040270 has 32 divisors (see below), whose sum is σ = 124253762688. Its totient is φ = 13399914528.

The previous prime is 51011040263. The next prime is 51011040271. The reversal of 51011040270 is 7204011015.

It is a happy number.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (51011040271) by changing a digit.

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 15 ways as a sum of consecutive naturals, for example, 12687304 + ... + 12691323.

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

Almost surely, 251011040270 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 25378704.

The product of its (nonzero) digits is 280, while the sum is 21.

Adding to 51011040270 its reverse (7204011015), we get a palindrome (58215051285).

The spelling of 51011040270 in words is "fifty-one billion, eleven million, forty thousand, two hundred seventy".

Divisors: 1 2 3 5 6 10 15 30 67 134 201 335 402 670 1005 2010 25378627 50757254 76135881 126893135 152271762 253786270 380679405 761358810 1700368009 3400736018 5101104027 8501840045 10202208054 17003680090 25505520135 51011040270