Search a number
-
+
50323151131 = 112415893811
BaseRepresentation
bin101110110111011111…
…100101100100011011
311210220002212221122021
4232313133211210123
51311030211314011
635041303435311
73431024504221
oct566737454433
9153802787567
1050323151131
111a38411a300
129905155b37
13498c9b5306
14261560cb11
151497e28471
hexbb77e591b

50323151131 has 6 divisors (see below), whose sum is σ = 55313876996. Its totient is φ = 45748319100.

The previous prime is 50323151083. The next prime is 50323151147. The reversal of 50323151131 is 13115132305.

It is not a de Polignac number, because 50323151131 - 27 = 50323151003 is a prime.

It is a super-3 number, since 3×503231511313 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 50323151096 and 50323151105.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 207946785 + ... + 207947026.

Almost surely, 250323151131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 415893833 (or 415893822 counting only the distinct ones).

The product of its (nonzero) digits is 1350, while the sum is 25.

Adding to 50323151131 its reverse (13115132305), we get a palindrome (63438283436).

The spelling of 50323151131 in words is "fifty billion, three hundred twenty-three million, one hundred fifty-one thousand, one hundred thirty-one".

Divisors: 1 11 121 415893811 4574831921 50323151131