Base | Representation |
---|---|
bin | 101110111110110010… |
… | …000111101110001111 |
3 | 11211012122000101022201 |
4 | 232332302013232033 |
5 | 1311303013401002 |
6 | 35101353022331 |
7 | 3434041152112 |
oct | 567662075617 |
9 | 154178011281 |
10 | 50445450127 |
11 | 1a437161356 |
12 | 993a0b49a7 |
13 | 49ac135797 |
14 | 2627966579 |
15 | 14a3a35087 |
hex | bbec87b8f |
50445450127 has 2 divisors, whose sum is σ = 50445450128. Its totient is φ = 50445450126.
The previous prime is 50445450119. The next prime is 50445450137. The reversal of 50445450127 is 72105454405.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50445450127 - 23 = 50445450119 is a prime.
It is a super-2 number, since 2×504454501272 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50445450137) 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, 25222725063 + 25222725064.
It is an arithmetic number, because the mean of its divisors is an integer number (25222725064).
Almost surely, 250445450127 is an apocalyptic number.
50445450127 is a deficient number, since it is larger than the sum of its proper divisors (1).
50445450127 is an equidigital number, since it uses as much as digits as its factorization.
50445450127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112000, while the sum is 37.
The spelling of 50445450127 in words is "fifty billion, four hundred forty-five million, four hundred fifty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.256 sec. • engine limits •