Search a number
-
+
50426301550013 = 471072900032979
BaseRepresentation
bin10110111011100110010011…
…10010101000110110111101
320121112201002122201210220122
423131303021302220312331
523102141031144100023
6255125304555024325
713423115522001014
oct1335631162506675
9217481078653818
1050426301550013
1115081746683284
1257a4b5643b0a5
13221a24512615c
14c64908959a7b
155c6a856252c8
hex2ddcc9ca8dbd

50426301550013 has 4 divisors (see below), whose sum is σ = 51499201583040. Its totient is φ = 49353401516988.

The previous prime is 50426301549997. The next prime is 50426301550033. The reversal of 50426301550013 is 31005510362405.

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 50426301550013 - 24 = 50426301549997 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 (50426301550033) 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, 536450016443 + ... + 536450016536.

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

Almost surely, 250426301550013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1072900033026.

The product of its (nonzero) digits is 54000, while the sum is 35.

The spelling of 50426301550013 in words is "fifty trillion, four hundred twenty-six billion, three hundred one million, five hundred fifty thousand, thirteen".

Divisors: 1 47 1072900032979 50426301550013