Base | Representation |
---|---|
bin | 10110111110101100001101… |
… | …01010011100001010101111 |
3 | 20121220212100021000101201122 |
4 | 23133112012222130022233 |
5 | 23110411130133303212 |
6 | 255250155513331155 |
7 | 13433566453521521 |
oct | 1337260652341257 |
9 | 217825307011648 |
10 | 50532549509807 |
11 | 151128088aa012 |
12 | 5801668706abb |
13 | 22272781ab511 |
14 | c69b076d3a11 |
15 | 5c9703127272 |
hex | 2df586a9c2af |
50532549509807 has 2 divisors, whose sum is σ = 50532549509808. Its totient is φ = 50532549509806.
The previous prime is 50532549509693. The next prime is 50532549509809. The reversal of 50532549509807 is 70890594523505.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 50532549509807 - 222 = 50532545315503 is a prime.
It is a super-2 number, since 2×505325495098072 (a number of 28 digits) contains 22 as substring.
Together with 50532549509809, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 50532549509807.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50532549509809) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25266274754903 + 25266274754904.
It is an arithmetic number, because the mean of its divisors is an integer number (25266274754904).
Almost surely, 250532549509807 is an apocalyptic number.
50532549509807 is a deficient number, since it is larger than the sum of its proper divisors (1).
50532549509807 is an equidigital number, since it uses as much as digits as its factorization.
50532549509807 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 68040000, while the sum is 62.
The spelling of 50532549509807 in words is "fifty trillion, five hundred thirty-two billion, five hundred forty-nine million, five hundred nine thousand, eight hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •