Search a number
-
+
50570036661 = 329881564127
BaseRepresentation
bin101111000110001101…
…011000010110110101
311211112022110000220210
4233012031120112311
51312031412133121
635122003220033
73440113135134
oct570615302665
9154468400823
1050570036661
111a4a0516031
129973977619
1349cbba7221
14263a31791b
1514ae944876
hexbc63585b5

50570036661 has 8 divisors (see below), whose sum is σ = 67429091584. Its totient is φ = 33712169760.

The previous prime is 50570036633. The next prime is 50570036687. The reversal of 50570036661 is 16663007505.

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

It is not a de Polignac number, because 50570036661 - 27 = 50570036533 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (50570036611) 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 7 ways as a sum of consecutive naturals, for example, 192421 + ... + 371706.

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

Almost surely, 250570036661 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 594011.

The product of its (nonzero) digits is 113400, while the sum is 39.

It can be divided in two parts, 505700 and 36661, that added together give a triangular number (542361 = T1041).

The spelling of 50570036661 in words is "fifty billion, five hundred seventy million, thirty-six thousand, six hundred sixty-one".

Divisors: 1 3 29881 89643 564127 1692381 16856678887 50570036661