Base | Representation |
---|---|
bin | 10110110011010111110100… |
… | …00011001101110011111111 |
3 | 20120112200111201111000221020 |
4 | 23121223322003031303333 |
5 | 23033023140200014021 |
6 | 254351401033035223 |
7 | 13363521141014541 |
oct | 1331537203156377 |
9 | 216480451430836 |
10 | 50143643360511 |
11 | 14a82888486978 |
12 | 575a210855b13 |
13 | 21c96aa06739c |
14 | c54d72a71691 |
15 | 5be54065a7c6 |
hex | 2d9afa0cdcff |
50143643360511 has 16 divisors (see below), whose sum is σ = 67507764080640. Its totient is φ = 33104313571680.
The previous prime is 50143643360501. The next prime is 50143643360597. The reversal of 50143643360511 is 11506334634105.
It is not a de Polignac number, because 50143643360511 - 214 = 50143643344127 is a prime.
It is a super-2 number, since 2×501436433605112 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50143643360501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52635426 + ... + 53579616.
It is an arithmetic number, because the mean of its divisors is an integer number (4219235255040).
Almost surely, 250143643360511 is an apocalyptic number.
50143643360511 is a deficient number, since it is larger than the sum of its proper divisors (17364120720129).
50143643360511 is a wasteful number, since it uses less digits than its factorization.
50143643360511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1116166.
The product of its (nonzero) digits is 388800, while the sum is 42.
Adding to 50143643360511 its reverse (11506334634105), we get a palindrome (61649977994616).
The spelling of 50143643360511 in words is "fifty trillion, one hundred forty-three billion, six hundred forty-three million, three hundred sixty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •