Base | Representation |
---|---|
bin | 100101111001110001001… |
… | …011011011010101100101 |
3 | 100020000001110121200202012 |
4 | 211321301023123111211 |
5 | 320133310121033331 |
6 | 5312320443324005 |
7 | 356115426136541 |
oct | 45716113332545 |
9 | 10200043550665 |
10 | 2604649002341 |
11 | 914697505681 |
12 | 36096b820605 |
13 | 15b804408129 |
14 | 900cc348a21 |
15 | 47b4606c82b |
hex | 25e712db565 |
2604649002341 has 2 divisors, whose sum is σ = 2604649002342. Its totient is φ = 2604649002340.
The previous prime is 2604649002289. The next prime is 2604649002413. The reversal of 2604649002341 is 1432009464062.
It is a happy number.
Together with next prime (2604649002413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2570554857025 + 34094145316 = 1603295^2 + 184646^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2604649002341 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2604649002541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1302324501170 + 1302324501171.
It is an arithmetic number, because the mean of its divisors is an integer number (1302324501171).
Almost surely, 22604649002341 is an apocalyptic number.
It is an amenable number.
2604649002341 is a deficient number, since it is larger than the sum of its proper divisors (1).
2604649002341 is an equidigital number, since it uses as much as digits as its factorization.
2604649002341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 248832, while the sum is 41.
The spelling of 2604649002341 in words is "two trillion, six hundred four billion, six hundred forty-nine million, two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •