Base | Representation |
---|---|
bin | 101111000010100011… |
… | …000001111000111101 |
3 | 11211101000211212200211 |
4 | 233002203001320331 |
5 | 1311420200243231 |
6 | 35111530352421 |
7 | 3435436020106 |
oct | 570243017075 |
9 | 154330755624 |
10 | 50508602941 |
11 | 1a469875a65 |
12 | 995728b711 |
13 | 49bc247804 |
14 | 26320c53ad |
15 | 14a935beb1 |
hex | bc28c1e3d |
50508602941 has 2 divisors, whose sum is σ = 50508602942. Its totient is φ = 50508602940.
The previous prime is 50508602891. The next prime is 50508602987. The reversal of 50508602941 is 14920680505.
50508602941 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30182112900 + 20326490041 = 173730^2 + 142571^2 .
It is a cyclic number.
It is not a de Polignac number, because 50508602941 - 29 = 50508602429 is a prime.
It is a super-2 number, since 2×505086029412 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50508602894 and 50508602903.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50508602041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25254301470 + 25254301471.
It is an arithmetic number, because the mean of its divisors is an integer number (25254301471).
Almost surely, 250508602941 is an apocalyptic number.
It is an amenable number.
50508602941 is a deficient number, since it is larger than the sum of its proper divisors (1).
50508602941 is an equidigital number, since it uses as much as digits as its factorization.
50508602941 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 86400, while the sum is 40.
The spelling of 50508602941 in words is "fifty billion, five hundred eight million, six hundred two thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •