Base | Representation |
---|---|
bin | 101111000010000111… |
… | …111100110011100111 |
3 | 11211100112111020002122 |
4 | 233002013330303213 |
5 | 1311411341113411 |
6 | 35111114300155 |
7 | 3435321463133 |
oct | 570207746347 |
9 | 154315436078 |
10 | 50501504231 |
11 | 1a465867662 |
12 | 9954a2765b |
13 | 49ba9306a9 |
14 | 26311983c3 |
15 | 14a89089db |
hex | bc21fcce7 |
50501504231 has 2 divisors, whose sum is σ = 50501504232. Its totient is φ = 50501504230.
The previous prime is 50501504201. The next prime is 50501504353. The reversal of 50501504231 is 13240510505.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50501504231 - 26 = 50501504167 is a prime.
It is a super-2 number, since 2×505015042312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50501504231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50501504201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25250752115 + 25250752116.
It is an arithmetic number, because the mean of its divisors is an integer number (25250752116).
Almost surely, 250501504231 is an apocalyptic number.
50501504231 is a deficient number, since it is larger than the sum of its proper divisors (1).
50501504231 is an equidigital number, since it uses as much as digits as its factorization.
50501504231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3000, while the sum is 26.
The spelling of 50501504231 in words is "fifty billion, five hundred one million, five hundred four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •