Base | Representation |
---|---|
bin | 10110110000110100100100… |
… | …01010100010111001011111 |
3 | 20120020022021210010011220111 |
4 | 23120122102022202321133 |
5 | 23030104142240334003 |
6 | 254243224235230451 |
7 | 13354266241105231 |
oct | 1330322212427137 |
9 | 216208253104814 |
10 | 50056001105503 |
11 | 14a496a3737568 |
12 | 57452315a8427 |
13 | 21c13508579b3 |
14 | c50a1ad54251 |
15 | 5bc1112a9e6d |
hex | 2d86922a2e5f |
50056001105503 has 4 divisors (see below), whose sum is σ = 50056051044448. Its totient is φ = 50055951166560.
The previous prime is 50056001105501. The next prime is 50056001105521. The reversal of 50056001105503 is 30550110065005.
50056001105503 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 50056001105503 - 21 = 50056001105501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50056001105501) 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 in 3 ways as a sum of consecutive naturals, for example, 23434503 + ... + 25481128.
It is an arithmetic number, because the mean of its divisors is an integer number (12514012761112).
Almost surely, 250056001105503 is an apocalyptic number.
50056001105503 is a deficient number, since it is larger than the sum of its proper divisors (49938945).
50056001105503 is a wasteful number, since it uses less digits than its factorization.
50056001105503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49938944.
The product of its (nonzero) digits is 11250, while the sum is 31.
The spelling of 50056001105503 in words is "fifty trillion, fifty-six billion, one million, one hundred five thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •