Search a number
-
+
50110113 = 316703371
BaseRepresentation
bin1011111100100…
…1111010100001
310111021212011010
42333021322201
5100312010423
64550011133
71145633424
oct277117241
9114255133
1050110113
1126316519
1214946aa9
13a4c6571
1469259bb
1545ec693
hex2fc9ea1

50110113 has 4 divisors (see below), whose sum is σ = 66813488. Its totient is φ = 33406740.

The previous prime is 50110111. The next prime is 50110121. The reversal of 50110113 is 31101105.

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 not a de Polignac number, because 50110113 - 21 = 50110111 is a prime.

It is a super-2 number, since 2×501101132 = 5022046849745538, which contains 22 as substring.

It is a Duffinian number.

It is a Curzon number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8351683 + ... + 8351688.

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

Almost surely, 250110113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 16703374.

The product of its (nonzero) digits is 15, while the sum is 12.

The square root of 50110113 is about 7078.8496946891. The cubic root of 50110113 is about 368.6733914206.

Adding to 50110113 its reverse (31101105), we get a palindrome (81211218).

The spelling of 50110113 in words is "fifty million, one hundred ten thousand, one hundred thirteen".

Divisors: 1 3 16703371 50110113