Base | Representation |
---|---|
bin | 101000000001001111011… |
… | …1110001000001000010101 |
3 | 201110211001011010110121011 |
4 | 1100002132332020020111 |
5 | 1210103430124201422 |
6 | 15410434003052221 |
7 | 1105243465010041 |
oct | 120023676101025 |
9 | 21424034113534 |
10 | 5500225225237 |
11 | 18306a5827016 |
12 | 749b92371071 |
13 | 30b890a8bbc2 |
14 | 1502d8877021 |
15 | 98117ee3077 |
hex | 5009ef88215 |
5500225225237 has 2 divisors, whose sum is σ = 5500225225238. Its totient is φ = 5500225225236.
The previous prime is 5500225225217. The next prime is 5500225225259. The reversal of 5500225225237 is 7325225220055.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5153962414756 + 346262810481 = 2270234^2 + 588441^2 .
It is a cyclic number.
It is not a de Polignac number, because 5500225225237 - 27 = 5500225225109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5500225225237.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5500225225217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2750112612618 + 2750112612619.
It is an arithmetic number, because the mean of its divisors is an integer number (2750112612619).
Almost surely, 25500225225237 is an apocalyptic number.
It is an amenable number.
5500225225237 is a deficient number, since it is larger than the sum of its proper divisors (1).
5500225225237 is an equidigital number, since it uses as much as digits as its factorization.
5500225225237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 420000, while the sum is 40.
The spelling of 5500225225237 in words is "five trillion, five hundred billion, two hundred twenty-five million, two hundred twenty-five thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •