Base | Representation |
---|---|
bin | 101000000010110010101… |
… | …0001010010010111001101 |
3 | 201111010122000022002002111 |
4 | 1100011211101102113031 |
5 | 1210132233321333103 |
6 | 15412144050224021 |
7 | 1105422103205164 |
oct | 120054521222715 |
9 | 21433560262074 |
10 | 5503552136653 |
11 | 183205278188a |
12 | 74a760585011 |
13 | 30bca110443c |
14 | 15053265a3db |
15 | 9826010e86d |
hex | 501654525cd |
5503552136653 has 2 divisors, whose sum is σ = 5503552136654. Its totient is φ = 5503552136652.
The previous prime is 5503552136633. The next prime is 5503552136657. The reversal of 5503552136653 is 3566312553055.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5382042725929 + 121509410724 = 2319923^2 + 348582^2 .
It is a cyclic number.
It is not a de Polignac number, because 5503552136653 - 233 = 5494962202061 is a prime.
It is a super-2 number, since 2×55035521366532 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5503552136597 and 5503552136606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5503552136657) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2751776068326 + 2751776068327.
It is an arithmetic number, because the mean of its divisors is an integer number (2751776068327).
Almost surely, 25503552136653 is an apocalyptic number.
It is an amenable number.
5503552136653 is a deficient number, since it is larger than the sum of its proper divisors (1).
5503552136653 is an equidigital number, since it uses as much as digits as its factorization.
5503552136653 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6075000, while the sum is 49.
The spelling of 5503552136653 in words is "five trillion, five hundred three billion, five hundred fifty-two million, one hundred thirty-six thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •