Base | Representation |
---|---|
bin | 10110111010111111101001… |
… | …00001000011101010011101 |
3 | 20121110201111222211212212012 |
4 | 23131133310201003222131 |
5 | 23101321023120300041 |
6 | 255111553110321005 |
7 | 13421452233462506 |
oct | 1335376441035235 |
9 | 217421458755765 |
10 | 50405543525021 |
11 | 15073964282923 |
12 | 57a0b22659165 |
13 | 22182b76a4129 |
14 | c638d9b13bad |
15 | 5c626d0743eb |
hex | 2dd7f4843a9d |
50405543525021 has 2 divisors, whose sum is σ = 50405543525022. Its totient is φ = 50405543525020.
The previous prime is 50405543525011. The next prime is 50405543525023. The reversal of 50405543525021 is 12052534550405.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49817693167225 + 587850357796 = 7058165^2 + 766714^2 .
It is a cyclic number.
It is not a de Polignac number, because 50405543525021 - 230 = 50404469783197 is a prime.
Together with 50405543525023, 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 50405543525021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50405543525023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25202771762510 + 25202771762511.
It is an arithmetic number, because the mean of its divisors is an integer number (25202771762511).
Almost surely, 250405543525021 is an apocalyptic number.
It is an amenable number.
50405543525021 is a deficient number, since it is larger than the sum of its proper divisors (1).
50405543525021 is an equidigital number, since it uses as much as digits as its factorization.
50405543525021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 600000, while the sum is 41.
The spelling of 50405543525021 in words is "fifty trillion, four hundred five billion, five hundred forty-three million, five hundred twenty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •