Search a number
-
+
50061050105 = 511910200911
BaseRepresentation
bin101110100111110111…
…110000000011111001
311210012211200211121212
4232213313300003321
51310011112100410
634555302012505
73421362622253
oct564767600371
9153184624555
1050061050105
111a25a180990
129851417135
13494a5c6951
1425cc8a2cd3
15147ee03b05
hexba7df00f9

50061050105 has 8 divisors (see below), whose sum is σ = 65534465664. Its totient is φ = 36408036400.

The previous prime is 50061050087. The next prime is 50061050113. The reversal of 50061050105 is 50105016005.

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

It is a de Polignac number, because none of the positive numbers 2k-50061050105 is a prime.

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

It is a Duffinian number.

It is an unprimeable number.

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

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

Almost surely, 250061050105 is an apocalyptic number.

50061050105 is a gapful number since it is divisible by the number (55) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 910200927.

The product of its (nonzero) digits is 750, while the sum is 23.

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

Divisors: 1 5 11 55 910200911 4551004555 10012210021 50061050105