Base | Representation |
---|---|
bin | 101111000101000010… |
… | …100110010011100101 |
3 | 11211110221120001202011 |
4 | 233011002212103211 |
5 | 1312011402323442 |
6 | 35120023114221 |
7 | 3436454406451 |
oct | 570502462345 |
9 | 154427501664 |
10 | 50550432997 |
11 | 1a490446559 |
12 | 99692a2971 |
13 | 49c7b0231c |
14 | 2637893661 |
15 | 14acd71117 |
hex | bc50a64e5 |
50550432997 has 2 divisors, whose sum is σ = 50550432998. Its totient is φ = 50550432996.
The previous prime is 50550432979. The next prime is 50550433057. The reversal of 50550432997 is 79923405505.
Together with previous prime (50550432979) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 50548978561 + 1454436 = 224831^2 + 1206^2 .
It is a cyclic number.
It is not a de Polignac number, because 50550432997 - 27 = 50550432869 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 50550432997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50550432917) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25275216498 + 25275216499.
It is an arithmetic number, because the mean of its divisors is an integer number (25275216499).
Almost surely, 250550432997 is an apocalyptic number.
It is an amenable number.
50550432997 is a deficient number, since it is larger than the sum of its proper divisors (1).
50550432997 is an equidigital number, since it uses as much as digits as its factorization.
50550432997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1701000, while the sum is 49.
The spelling of 50550432997 in words is "fifty billion, five hundred fifty million, four hundred thirty-two thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •