Base | Representation |
---|---|
bin | 101111000010010101… |
… | …100001001001101011 |
3 | 11211100210011221000202 |
4 | 233002111201021223 |
5 | 1311413243422341 |
6 | 35111322422415 |
7 | 3435363635501 |
oct | 570225411153 |
9 | 154323157022 |
10 | 50505060971 |
11 | 1a467876912 |
12 | 9956061a0b |
13 | 49bb5a7581 |
14 | 2631842671 |
15 | 14a8dac79b |
hex | bc256126b |
50505060971 has 2 divisors, whose sum is σ = 50505060972. Its totient is φ = 50505060970.
The previous prime is 50505060967. The next prime is 50505061001. The reversal of 50505060971 is 17906050505.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50505060971 - 22 = 50505060967 is a prime.
It is a super-2 number, since 2×505050609712 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50505060901) 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, 25252530485 + 25252530486.
It is an arithmetic number, because the mean of its divisors is an integer number (25252530486).
Almost surely, 250505060971 is an apocalyptic number.
50505060971 is a deficient number, since it is larger than the sum of its proper divisors (1).
50505060971 is an equidigital number, since it uses as much as digits as its factorization.
50505060971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 47250, while the sum is 38.
The spelling of 50505060971 in words is "fifty billion, five hundred five million, sixty thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •