Search a number
-
+
52107001155 = 3251117193110513
BaseRepresentation
bin110000100001110100…
…011011110101000011
311222111102111220211200
4300201310123311003
51323203343014110
635534305512243
73523155126156
oct604164336503
9158442456750
1052107001155
112010a053220
12a122642683
134bb543c481
1427444bdc9d
15154e8416c0
hexc21d1bd43

52107001155 has 192 divisors, whose sum is σ = 113369518080. Its totient is φ = 21797683200.

The previous prime is 52107001123. The next prime is 52107001241. The reversal of 52107001155 is 55110070125.

It is not a de Polignac number, because 52107001155 - 25 = 52107001123 is a prime.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 4951179 + ... + 4961691.

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

Almost surely, 252107001155 is an apocalyptic number.

52107001155 is a gapful number since it is divisible by the number (55) formed by its first and last digit.

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

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

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

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

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

The product of its (nonzero) digits is 1750, while the sum is 27.

The spelling of 52107001155 in words is "fifty-two billion, one hundred seven million, one thousand, one hundred fifty-five".