Search a number
-
+
50110655065 = 527493645737
BaseRepresentation
bin101110101010110100…
…111110101001011001
311210100022001000211121
4232222310332221121
51310111311430230
635004233125241
73422534353162
oct565264765131
9153308030747
1050110655065
111a285181919
129865b59821
1349579742b3
1425d52d6769
15148445177a
hexbaad3ea59

50110655065 has 8 divisors (see below), whose sum is σ = 60154677000. Its totient is φ = 40073930112.

The previous prime is 50110655041. The next prime is 50110655069. The reversal of 50110655065 is 56055601105.

It can be written as a sum of positive squares in 4 ways, for example, as 280361536 + 49830293529 = 16744^2 + 223227^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 50110655065 - 217 = 50110523993 is a prime.

It is a super-2 number, since 2×501106550652 (a number of 22 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 50110655065.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1809124 + ... + 1836613.

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

Almost surely, 250110655065 is an apocalyptic number.

It is an amenable number.

50110655065 is a deficient number, since it is larger than the sum of its proper divisors (10044021935).

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

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

The sum of its prime factors is 3648491.

The product of its (nonzero) digits is 22500, while the sum is 34.

The spelling of 50110655065 in words is "fifty billion, one hundred ten million, six hundred fifty-five thousand, sixty-five".

Divisors: 1 5 2749 13745 3645737 18228685 10022131013 50110655065