Base | Representation |
---|---|
bin | 100100010010010110001… |
… | …100000101011101011101 |
3 | 22211101102022210121121221 |
4 | 210102112030011131131 |
5 | 311323343300012143 |
6 | 5145313330453341 |
7 | 345104515632604 |
oct | 44222614053535 |
9 | 8741368717557 |
10 | 2493600782173 |
11 | 8815916a7206 |
12 | 343339a34251 |
13 | 1511b79b9b07 |
14 | 88995c64a3b |
15 | 44ce6e1b2ed |
hex | 2449630575d |
2493600782173 has 2 divisors, whose sum is σ = 2493600782174. Its totient is φ = 2493600782172.
The previous prime is 2493600782159. The next prime is 2493600782219. The reversal of 2493600782173 is 3712870063942.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1682408743929 + 811192038244 = 1297077^2 + 900662^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2493600782173 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2493600782173.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2493600782573) 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, 1246800391086 + 1246800391087.
It is an arithmetic number, because the mean of its divisors is an integer number (1246800391087).
Almost surely, 22493600782173 is an apocalyptic number.
It is an amenable number.
2493600782173 is a deficient number, since it is larger than the sum of its proper divisors (1).
2493600782173 is an equidigital number, since it uses as much as digits as its factorization.
2493600782173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3048192, while the sum is 52.
The spelling of 2493600782173 in words is "two trillion, four hundred ninety-three billion, six hundred million, seven hundred eighty-two thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •