Search a number
-
+
50050105605013 = 187432670335891
BaseRepresentation
bin10110110000101001100101…
…10000111111101110010101
320120012202001220200201121111
423120110302300333232111
523030010104013330023
6254240411234215021
713354000163142163
oct1330246260775625
9216182056621544
1050050105605013
1114a471488a0808
125744067124471
1321c0921319777
14c5061bd88233
155bbdb891500d
hex2d8532c3fb95

50050105605013 has 4 divisors (see below), whose sum is σ = 50052775959648. Its totient is φ = 50047435250380.

The previous prime is 50050105605011. The next prime is 50050105605061. The reversal of 50050105605013 is 31050650105005.

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 50050105605013 - 21 = 50050105605011 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 250050105605013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2670354634.

The product of its (nonzero) digits is 11250, while the sum is 31.

The spelling of 50050105605013 in words is "fifty trillion, fifty billion, one hundred five million, six hundred five thousand, thirteen".

Divisors: 1 18743 2670335891 50050105605013