Search a number
-
+
50610611061 = 3237151983817
BaseRepresentation
bin101111001000101000…
…001010001101110101
311211122010210102112100
4233020220022031311
51312122304023221
635130013012313
73441115044633
oct571050121565
9154563712470
1050610611061
111a51140919a
129985484099
134a0741234a
14264187a353
1514b32ab926
hexbc8a0a375

50610611061 has 12 divisors (see below), whose sum is σ = 75080006092. Its totient is φ = 32828504256.

The previous prime is 50610611057. The next prime is 50610611063. The reversal of 50610611061 is 16011601605.

It can be written as a sum of positive squares in 2 ways, for example, as 28957488561 + 21653122500 = 170169^2 + 147150^2 .

It is not a de Polignac number, because 50610611061 - 22 = 50610611057 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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 11 ways as a sum of consecutive naturals, for example, 75991576 + ... + 75992241.

Almost surely, 250610611061 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

Divisors: 1 3 9 37 111 333 151983817 455951451 1367854353 5623401229 16870203687 50610611061