Base | Representation |
---|---|
bin | 10110111111101100110110… |
… | …11001111010011011010001 |
3 | 20122001011221002201122000121 |
4 | 23133312123121322123101 |
5 | 23111443220323042301 |
6 | 255314135520350241 |
7 | 13436235526401235 |
oct | 1337663331723321 |
9 | 218034832648017 |
10 | 50567257237201 |
11 | 151264a9474341 |
12 | 5808334175381 |
13 | 222a6199ab713 |
14 | c6b67b07c5c5 |
15 | 5ca5851c33a1 |
hex | 2dfd9b67a6d1 |
50567257237201 has 2 divisors, whose sum is σ = 50567257237202. Its totient is φ = 50567257237200.
The previous prime is 50567257237199. The next prime is 50567257237247. The reversal of 50567257237201 is 10273275276505.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 35180034988176 + 15387222249025 = 5931276^2 + 3922655^2 .
It is a cyclic number.
It is not a de Polignac number, because 50567257237201 - 21 = 50567257237199 is a prime.
Together with 50567257237199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (50567257237901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25283628618600 + 25283628618601.
It is an arithmetic number, because the mean of its divisors is an integer number (25283628618601).
Almost surely, 250567257237201 is an apocalyptic number.
It is an amenable number.
50567257237201 is a deficient number, since it is larger than the sum of its proper divisors (1).
50567257237201 is an equidigital number, since it uses as much as digits as its factorization.
50567257237201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6174000, while the sum is 52.
The spelling of 50567257237201 in words is "fifty trillion, five hundred sixty-seven billion, two hundred fifty-seven million, two hundred thirty-seven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •