Search a number
-
+
50105610001 = 383647202201
BaseRepresentation
bin101110101010100001…
…101110111100010001
311210022221112201022101
4232222201232330101
51310104014010001
635003533040401
73422443441426
oct565241567421
9153287481271
1050105610001
111a282346447
129864326101
1349568c8b55
1425d4781d4d
151483ca6a01
hexbaa86ef11

50105610001 has 8 divisors (see below), whose sum is σ = 50314328064. Its totient is φ = 49897298400.

The previous prime is 50105609977. The next prime is 50105610019. The reversal of 50105610001 is 10001650105.

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 50105610001 - 211 = 50105607953 is a prime.

It is a super-2 number, since 2×501056100012 (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 (50105610901) 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, 146701 + ... + 348901.

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

Almost surely, 250105610001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 203231.

The product of its (nonzero) digits is 150, while the sum is 19.

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

Divisors: 1 383 647 202201 247801 77442983 130824047 50105610001