Search a number
-
+
50315015381 is a prime number
BaseRepresentation
bin101110110111000000…
…100011010011010101
311210212112120121111012
4232313000203103111
51311021120443011
635040413222005
73430565400641
oct566700432325
9153775517435
1050315015381
111a37a572844
129902491905
13498b0c7167
1426144d1c21
15149736ca8b
hexbb70234d5

50315015381 has 2 divisors, whose sum is σ = 50315015382. Its totient is φ = 50315015380.

The previous prime is 50315015371. The next prime is 50315015417. The reversal of 50315015381 is 18351051305.

50315015381 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 48635245156 + 1679770225 = 220534^2 + 40985^2 .

It is a cyclic number.

It is not a de Polignac number, because 50315015381 - 214 = 50314998997 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 250315015381 is an apocalyptic number.

It is an amenable number.

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

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

50315015381 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 9000, while the sum is 32.

Adding to 50315015381 its reverse (18351051305), we get a palindrome (68666066686).

The spelling of 50315015381 in words is "fifty billion, three hundred fifteen million, fifteen thousand, three hundred eighty-one".