Base | Representation |
---|---|
bin | 110011101110110000… |
… | …010101001010010101 |
3 | 12022101001012021210222 |
4 | 303232300111022111 |
5 | 1402224041121144 |
6 | 41303411324125 |
7 | 4004314605431 |
oct | 635660251225 |
9 | 168331167728 |
10 | 55545254549 |
11 | 21613936954 |
12 | a921bb0645 |
13 | 5312869b35 |
14 | 298cda79c1 |
15 | 16a16032ee |
hex | ceec15295 |
55545254549 has 2 divisors, whose sum is σ = 55545254550. Its totient is φ = 55545254548.
The previous prime is 55545254503. The next prime is 55545254551. The reversal of 55545254549 is 94545254555.
55545254549 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 50392168324 + 5153086225 = 224482^2 + 71785^2 .
It is a cyclic number.
It is not a de Polignac number, because 55545254549 - 228 = 55276819093 is a prime.
Together with 55545254551, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 55545254549.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55545254599) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27772627274 + 27772627275.
It is an arithmetic number, because the mean of its divisors is an integer number (27772627275).
Almost surely, 255545254549 is an apocalyptic number.
It is an amenable number.
55545254549 is a deficient number, since it is larger than the sum of its proper divisors (1).
55545254549 is an equidigital number, since it uses as much as digits as its factorization.
55545254549 is an evil number, because the sum of its binary digits is even.
The product of its digits is 18000000, while the sum is 53.
The spelling of 55545254549 in words is "fifty-five billion, five hundred forty-five million, two hundred fifty-four thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •