Base | Representation |
---|---|
bin | 101111010100111001… |
… | …011111101101100011 |
3 | 11212011111011202120101 |
4 | 233110321133231203 |
5 | 1313033004412042 |
6 | 35202245323231 |
7 | 3446164654114 |
oct | 572471375543 |
9 | 155144152511 |
10 | 50816482147 |
11 | 1a607641192 |
12 | 9a22406517 |
13 | 4a3ac73a62 |
14 | 2660d4a20b |
15 | 14c63c56b7 |
hex | bd4e5fb63 |
50816482147 has 2 divisors, whose sum is σ = 50816482148. Its totient is φ = 50816482146.
The previous prime is 50816482133. The next prime is 50816482163. The reversal of 50816482147 is 74128461805.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50816482147 - 219 = 50815957859 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50816482097 and 50816482106.
It is not a weakly prime, because it can be changed into another prime (50816482247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25408241073 + 25408241074.
It is an arithmetic number, because the mean of its divisors is an integer number (25408241074).
Almost surely, 250816482147 is an apocalyptic number.
50816482147 is a deficient number, since it is larger than the sum of its proper divisors (1).
50816482147 is an equidigital number, since it uses as much as digits as its factorization.
50816482147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 430080, while the sum is 46.
The spelling of 50816482147 in words is "fifty billion, eight hundred sixteen million, four hundred eighty-two thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •