Base | Representation |
---|---|
bin | 10110111000000011010001… |
… | …01100101111101111111011 |
3 | 20121010001111001220220101221 |
4 | 23130001220230233233323 |
5 | 23043141414330444011 |
6 | 254553310055452511 |
7 | 13411242155636254 |
oct | 1334015054575773 |
9 | 217101431826357 |
10 | 50304413531131 |
11 | 15034a89006681 |
12 | 57853ba387137 |
13 | 220b8bba41766 |
14 | c5ca64987b2b |
15 | 5c37eea2b971 |
hex | 2dc068b2fbfb |
50304413531131 has 4 divisors (see below), whose sum is σ = 52491561945552. Its totient is φ = 48117265116712.
The previous prime is 50304413531033. The next prime is 50304413531137. The reversal of 50304413531131 is 13113531440305.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 50304413531131 - 27 = 50304413531003 is a prime.
It is a super-2 number, since 2×503044135311312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50304413531137) 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, 1093574207176 + ... + 1093574207221.
It is an arithmetic number, because the mean of its divisors is an integer number (13122890486388).
Almost surely, 250304413531131 is an apocalyptic number.
50304413531131 is a deficient number, since it is larger than the sum of its proper divisors (2187148414421).
50304413531131 is a wasteful number, since it uses less digits than its factorization.
50304413531131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2187148414420.
The product of its (nonzero) digits is 32400, while the sum is 34.
Adding to 50304413531131 its reverse (13113531440305), we get a palindrome (63417944971436).
The spelling of 50304413531131 in words is "fifty trillion, three hundred four billion, four hundred thirteen million, five hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •