Search a number
-
+
50001601111613 is a prime number
BaseRepresentation
bin10110101111001111001111…
…01011000010011000111101
320120001002212112221011100222
423113213213223002120331
523023211234341032423
6254202230214431125
713350332200561034
oct1327474753023075
9216032775834328
1050001601111613
1114a28618319a28
12573678b0624a5
1321b91913579b8
14c4c13a10b71b
155ba9ca4cd3c8
hex2d79e7ac263d

50001601111613 has 2 divisors, whose sum is σ = 50001601111614. Its totient is φ = 50001601111612.

The previous prime is 50001601111589. The next prime is 50001601111661. The reversal of 50001601111613 is 31611110610005.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 49808969657209 + 192631454404 = 7057547^2 + 438898^2 .

It is a cyclic number.

It is not a de Polignac number, because 50001601111613 - 218 = 50001600849469 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (50001601111213) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25000800555806 + 25000800555807.

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

Almost surely, 250001601111613 is an apocalyptic number.

It is an amenable number.

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

50001601111613 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 540, while the sum is 26.

Adding to 50001601111613 its reverse (31611110610005), we get a palindrome (81612711721618).

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