Search a number
-
+
50104909131 = 316701636377
BaseRepresentation
bin101110101010011111…
…000011110101001011
311210022220020002220020
4232222133003311023
51310103324043011
635003510031523
73422434462164
oct565237036513
9153286202806
1050104909131
111a281a07912
1298640485a3
134956711b34
1425d463c76b
151483bb9006
hexbaa7c3d4b

50104909131 has 4 divisors (see below), whose sum is σ = 66806545512. Its totient is φ = 33403272752.

The previous prime is 50104909051. The next prime is 50104909147. The reversal of 50104909131 is 13190940105.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 50104909131 - 27 = 50104909003 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 50104909092 and 50104909101.

It is not an unprimeable number, because it can be changed into a prime (50104909331) 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, 8350818186 + ... + 8350818191.

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

Almost surely, 250104909131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 16701636380.

The product of its (nonzero) digits is 4860, while the sum is 33.

The spelling of 50104909131 in words is "fifty billion, one hundred four million, nine hundred nine thousand, one hundred thirty-one".

Divisors: 1 3 16701636377 50104909131