Base | Representation |
---|---|
bin | 101000011000101001110… |
… | …0101010111010010000011 |
3 | 201122121210220002011222211 |
4 | 1100301103211113102003 |
5 | 1211414411003100201 |
6 | 15445510423042551 |
7 | 1112003364660235 |
oct | 120612345272203 |
9 | 21577726064884 |
10 | 5550500050051 |
11 | 184aa54639010 |
12 | 7578832a0457 |
13 | 313543753858 |
14 | 1529078a6255 |
15 | 995aba72651 |
hex | 50c53957483 |
5550500050051 has 16 divisors (see below), whose sum is σ = 6090497981568. Its totient is φ = 5016456043200.
The previous prime is 5550500050049. The next prime is 5550500050087. The reversal of 5550500050051 is 1500500050555.
It is a cyclic number.
It is not a de Polignac number, because 5550500050051 - 21 = 5550500050049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5550500049995 and 5550500050022.
It is not an unprimeable number, because it can be changed into a prime (5550500053051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 786831 + ... + 3423463.
It is an arithmetic number, because the mean of its divisors is an integer number (380656123848).
Almost surely, 25550500050051 is an apocalyptic number.
5550500050051 is a deficient number, since it is larger than the sum of its proper divisors (539997931517).
5550500050051 is a wasteful number, since it uses less digits than its factorization.
5550500050051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2637762.
The product of its (nonzero) digits is 15625, while the sum is 31.
The spelling of 5550500050051 in words is "five trillion, five hundred fifty billion, five hundred million, fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •