Base | Representation |
---|---|
bin | 101000011000101001111… |
… | …1000011100000101100101 |
3 | 201122121211020111020021111 |
4 | 1100301103320130011211 |
5 | 1211414413243103334 |
6 | 15445511122145021 |
7 | 1112003455324561 |
oct | 120612370340545 |
9 | 21577736436244 |
10 | 5550505050469 |
11 | 184aa57443995 |
12 | 757884ab2171 |
13 | 3135447b4892 |
14 | 1529084086a1 |
15 | 995ac20e064 |
hex | 50c53e1c165 |
5550505050469 has 2 divisors, whose sum is σ = 5550505050470. Its totient is φ = 5550505050468.
The previous prime is 5550505050457. The next prime is 5550505050499. The reversal of 5550505050469 is 9640505050555.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3644517719844 + 1905987330625 = 1909062^2 + 1380575^2 .
It is a cyclic number.
It is not a de Polignac number, because 5550505050469 - 229 = 5549968179557 is a prime.
It is a super-2 number, since 2×55505050504692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5550505050499) 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 as a sum of consecutive naturals, namely, 2775252525234 + 2775252525235.
It is an arithmetic number, because the mean of its divisors is an integer number (2775252525235).
Almost surely, 25550505050469 is an apocalyptic number.
It is an amenable number.
5550505050469 is a deficient number, since it is larger than the sum of its proper divisors (1).
5550505050469 is an equidigital number, since it uses as much as digits as its factorization.
5550505050469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3375000, while the sum is 49.
The spelling of 5550505050469 in words is "five trillion, five hundred fifty billion, five hundred five million, fifty thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •