Base | Representation |
---|---|
bin | 1011111100111… |
… | …1000101111111 |
3 | 10111022221020211 |
4 | 2333033011333 |
5 | 100313200302 |
6 | 4550253251 |
7 | 1146052321 |
oct | 277170577 |
9 | 114287224 |
10 | 50131327 |
11 | 26330454 |
12 | 14957227 |
13 | a50310c |
14 | 692d611 |
15 | 4603ad7 |
hex | 2fcf17f |
50131327 has 2 divisors, whose sum is σ = 50131328. Its totient is φ = 50131326.
The previous prime is 50131321. The next prime is 50131349. The reversal of 50131327 is 72313105.
It is an a-pointer prime, because the next prime (50131349) can be obtained adding 50131327 to its sum of digits (22).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50131327 - 211 = 50129279 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50131298 and 50131307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50131321) 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 as a sum of consecutive naturals, namely, 25065663 + 25065664.
It is an arithmetic number, because the mean of its divisors is an integer number (25065664).
Almost surely, 250131327 is an apocalyptic number.
50131327 is a deficient number, since it is larger than the sum of its proper divisors (1).
50131327 is an equidigital number, since it uses as much as digits as its factorization.
50131327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 22.
The square root of 50131327 is about 7080.3479434276. The cubic root of 50131327 is about 368.7254097554.
The spelling of 50131327 in words is "fifty million, one hundred thirty-one thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •