Search a number
-
+
50610556001 = 352714349463
BaseRepresentation
bin101111001000100111…
…111100110001100001
311211122010200122000002
4233020213330301201
51312122300243001
635130011505345
73441114425255
oct571047746141
9154563618002
1050610556001
111a511380895
129985458255
134a073c3275
142641864265
1514b329a46b
hexbc89fcc61

50610556001 has 4 divisors (see below), whose sum is σ = 50624908992. Its totient is φ = 50596203012.

The previous prime is 50610555997. The next prime is 50610556013. The reversal of 50610556001 is 10065501605.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 50610556001 - 22 = 50610555997 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 250610556001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 14352990.

The product of its (nonzero) digits is 4500, while the sum is 29.

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

Divisors: 1 3527 14349463 50610556001