Base | Representation |
---|---|
bin | 101110101010110110… |
… | …011000010111000011 |
3 | 11210100022201200220110 |
4 | 232222312120113003 |
5 | 1310111410210111 |
6 | 35004245042403 |
7 | 3422540443413 |
oct | 565266302703 |
9 | 153308650813 |
10 | 50111022531 |
11 | 1a285402a09 |
12 | 98660b6403 |
13 | 4957a7262b |
14 | 25d5390643 |
15 | 14844c55a6 |
hex | baad985c3 |
50111022531 has 8 divisors (see below), whose sum is σ = 68368527040. Its totient is φ = 32630433192.
The previous prime is 50111022527. The next prime is 50111022623. The reversal of 50111022531 is 13522011105.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50111022531 - 22 = 50111022527 is a prime.
It is a super-2 number, since 2×501110225312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50111022498 and 50111022507.
It is not an unprimeable number, because it can be changed into a prime (50111222531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 194228641 + ... + 194228898.
It is an arithmetic number, because the mean of its divisors is an integer number (8546065880).
Almost surely, 250111022531 is an apocalyptic number.
50111022531 is a deficient number, since it is larger than the sum of its proper divisors (18257504509).
50111022531 is a wasteful number, since it uses less digits than its factorization.
50111022531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388457585.
The product of its (nonzero) digits is 300, while the sum is 21.
Adding to 50111022531 its reverse (13522011105), we get a palindrome (63633033636).
The spelling of 50111022531 in words is "fifty billion, one hundred eleven million, twenty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •