Search a number
-
+
50513510406613 = 735631229069087
BaseRepresentation
bin10110111110001000101111…
…10110000001100111010101
320121212001012101120202002111
423133010113312001213111
523110103132131002423
6255233330351311021
713432323610024162
oct1337042766014725
9217761171522074
1050513510406613
1115105728815a91
1257b9a3451b471
1322255328cc497
14c68c1cc9b069
155c8e8b91660d
hex2df117d819d5

50513510406613 has 8 divisors (see below), whose sum is σ = 51296427456768. Its totient is φ = 49733051495904.

The previous prime is 50513510406607. The next prime is 50513510406637. The reversal of 50513510406613 is 31660401531505.

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

It is a cyclic number.

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

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

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 250513510406613 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1229069723.

The product of its (nonzero) digits is 162000, while the sum is 40.

The spelling of 50513510406613 in words is "fifty trillion, five hundred thirteen billion, five hundred ten million, four hundred six thousand, six hundred thirteen".

Divisors: 1 73 563 41099 1229069087 89722043351 691965895981 50513510406613