Base | Representation |
---|---|
bin | 101111000010000111… |
… | …111100101101010111 |
3 | 11211100112111012112211 |
4 | 233002013330231113 |
5 | 1311411341110311 |
6 | 35111114254251 |
7 | 3435321462022 |
oct | 570207745527 |
9 | 154315435484 |
10 | 50501503831 |
11 | 1a465867329 |
12 | 9954a27387 |
13 | 49ba93045c |
14 | 26311981b9 |
15 | 14a8908821 |
hex | bc21fcb57 |
50501503831 has 2 divisors, whose sum is σ = 50501503832. Its totient is φ = 50501503830.
The previous prime is 50501503693. The next prime is 50501503909. The reversal of 50501503831 is 13830510505.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 50501503831 - 233 = 41911569239 is a prime.
It is a super-2 number, since 2×505015038312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50501503793 and 50501503802.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50501503231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25250751915 + 25250751916.
It is an arithmetic number, because the mean of its divisors is an integer number (25250751916).
Almost surely, 250501503831 is an apocalyptic number.
50501503831 is a deficient number, since it is larger than the sum of its proper divisors (1).
50501503831 is an equidigital number, since it uses as much as digits as its factorization.
50501503831 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9000, while the sum is 31.
The spelling of 50501503831 in words is "fifty billion, five hundred one million, five hundred three thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •