Base | Representation |
---|---|
bin | 101000000001011001010… |
… | …1010001101111101010101 |
3 | 201110211220011200201201222 |
4 | 1100002302222031331111 |
5 | 1210110114210104144 |
6 | 15410530443100125 |
7 | 1105254615511433 |
oct | 120026252157525 |
9 | 21424804621658 |
10 | 5500555550549 |
11 | 1830855233344 |
12 | 74a064b11645 |
13 | 30b914346a77 |
14 | 15032a6a1d53 |
15 | 98136ee22ee |
hex | 500b2a8df55 |
5500555550549 has 2 divisors, whose sum is σ = 5500555550550. Its totient is φ = 5500555550548.
The previous prime is 5500555550527. The next prime is 5500555550569. The reversal of 5500555550549 is 9450555550055.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5091476344900 + 409079205649 = 2256430^2 + 639593^2 .
It is a cyclic number.
It is not a de Polignac number, because 5500555550549 - 240 = 4401043922773 is a prime.
It is a super-2 number, since 2×55005555505492 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5500555550549.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5500555550569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2750277775274 + 2750277775275.
It is an arithmetic number, because the mean of its divisors is an integer number (2750277775275).
Almost surely, 25500555550549 is an apocalyptic number.
It is an amenable number.
5500555550549 is a deficient number, since it is larger than the sum of its proper divisors (1).
5500555550549 is an equidigital number, since it uses as much as digits as its factorization.
5500555550549 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14062500, while the sum is 53.
The spelling of 5500555550549 in words is "five trillion, five hundred billion, five hundred fifty-five million, five hundred fifty thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •