Base | Representation |
---|---|
bin | 10110111111001101001110… |
… | …01100110001011101101101 |
3 | 20121222120002121010022001202 |
4 | 23133212213030301131231 |
5 | 23111203430431000104 |
6 | 255302250441415245 |
7 | 13435064642031452 |
oct | 1337464714613555 |
9 | 217876077108052 |
10 | 50550275250029 |
11 | 1511a284598aa5 |
12 | 5804b94a9a525 |
13 | 2228b416540b9 |
14 | c6a90992b829 |
15 | 5c9dde3a851e |
hex | 2df9a733176d |
50550275250029 has 4 divisors (see below), whose sum is σ = 51242744774076. Its totient is φ = 49857805725984.
The previous prime is 50550275249993. The next prime is 50550275250067. The reversal of 50550275250029 is 92005257205505.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 34203431656900 + 16346843593129 = 5848370^2 + 4043123^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50550275250029 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 (50550275250089) 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, 346234761914 + ... + 346234762059.
It is an arithmetic number, because the mean of its divisors is an integer number (12810686193519).
Almost surely, 250550275250029 is an apocalyptic number.
It is an amenable number.
50550275250029 is a deficient number, since it is larger than the sum of its proper divisors (692469524047).
50550275250029 is an equidigital number, since it uses as much as digits as its factorization.
50550275250029 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 692469524046.
The product of its (nonzero) digits is 1575000, while the sum is 47.
The spelling of 50550275250029 in words is "fifty trillion, five hundred fifty billion, two hundred seventy-five million, two hundred fifty thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •