Base | Representation |
---|---|
bin | 10110111101110000100001… |
… | …01010010101101001011101 |
3 | 20121210210122000121122220010 |
4 | 23132320100222111221131 |
5 | 23104400013240004131 |
6 | 255223340044313433 |
7 | 13431353406632331 |
oct | 1336702052255135 |
9 | 217723560548803 |
10 | 50500505000541 |
11 | 15100164588a02 |
12 | 57b7404b42879 |
13 | 222423c386c2b |
14 | c683479257c1 |
15 | 5c8979c97b46 |
hex | 2dee10a95a5d |
50500505000541 has 4 divisors (see below), whose sum is σ = 67334006667392. Its totient is φ = 33667003333692.
The previous prime is 50500505000527. The next prime is 50500505000551. The reversal of 50500505000541 is 14500050500505.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 50500505000541 - 213 = 50500504992349 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50500505000499 and 50500505000508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50500505000551) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8416750833421 + ... + 8416750833426.
It is an arithmetic number, because the mean of its divisors is an integer number (16833501666848).
Almost surely, 250500505000541 is an apocalyptic number.
It is an amenable number.
50500505000541 is a deficient number, since it is larger than the sum of its proper divisors (16833501666851).
50500505000541 is a wasteful number, since it uses less digits than its factorization.
50500505000541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16833501666850.
The product of its (nonzero) digits is 12500, while the sum is 30.
The spelling of 50500505000541 in words is "fifty trillion, five hundred billion, five hundred five million, five hundred forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •