Search a number
-
+
50040512013 = 3294114028739
BaseRepresentation
bin101110100110101001…
…011001111000001101
311210011102001101122210
4232212221121320031
51304440332341023
634553245501033
73421023222402
oct564651317015
9153142041583
1050040512013
111a249623358
129846571779
13494628562b
1425c9c782a9
15147d1e8593
hexba6a59e0d

50040512013 has 16 divisors (see below), whose sum is σ = 70704849600. Its totient is φ = 31424373120.

The previous prime is 50040512003. The next prime is 50040512029. The reversal of 50040512013 is 31021504005.

It is not a de Polignac number, because 50040512013 - 25 = 50040511981 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (50040512003) 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 15 ways as a sum of consecutive naturals, for example, 7010803 + ... + 7017936.

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

Almost surely, 250040512013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 14028812.

The product of its (nonzero) digits is 600, while the sum is 21.

The spelling of 50040512013 in words is "fifty billion, forty million, five hundred twelve thousand, thirteen".

Divisors: 1 3 29 41 87 123 1189 3567 14028739 42086217 406833431 575178299 1220500293 1725534897 16680170671 50040512013