Base | Representation |
---|---|
bin | 10110111111001100110100… |
… | …00100100101011111110011 |
3 | 20121222112112020200102220011 |
4 | 23133212122010211133303 |
5 | 23111203003040000201 |
6 | 255302212532555351 |
7 | 13435056325654315 |
oct | 1337463204453763 |
9 | 217875466612804 |
10 | 50550055000051 |
11 | 1511a181234a22 |
12 | 5804b33182b57 |
13 | 2228b07b29979 |
14 | c6a8c85977b5 |
15 | 5c9dc9d9e151 |
hex | 2df99a1257f3 |
50550055000051 has 8 divisors (see below), whose sum is σ = 53238140222400. Its totient is φ = 47864725378920.
The previous prime is 50550055000021. The next prime is 50550055000111. The reversal of 50550055000051 is 15000055005505.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50550055000051 - 225 = 50550021445619 is a prime.
It is a super-2 number, since 2×505500550000512 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50550054999977 and 50550055000022.
It is not an unprimeable number, because it can be changed into a prime (50550055000021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 688862641 + ... + 688936018.
It is an arithmetic number, because the mean of its divisors is an integer number (6654767527800).
Almost surely, 250550055000051 is an apocalyptic number.
50550055000051 is a deficient number, since it is larger than the sum of its proper divisors (2688085222349).
50550055000051 is a wasteful number, since it uses less digits than its factorization.
50550055000051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1377800609.
The product of its (nonzero) digits is 15625, while the sum is 31.
The spelling of 50550055000051 in words is "fifty trillion, five hundred fifty billion, fifty-five million, fifty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •