Base | Representation |
---|---|
bin | 100101111001100001110… |
… | …000010110101111001001 |
3 | 100012222101102201120122201 |
4 | 211321201300112233021 |
5 | 320132242400403434 |
6 | 5312235041320201 |
7 | 356106134562061 |
oct | 45714160265711 |
9 | 10188342646581 |
10 | 2604390247369 |
11 | 914574442199 |
12 | 3608b9036061 |
13 | 15b79291b791 |
14 | 900a5c303a1 |
15 | 47b2d4a9614 |
hex | 25e61c16bc9 |
2604390247369 has 2 divisors, whose sum is σ = 2604390247370. Its totient is φ = 2604390247368.
The previous prime is 2604390247339. The next prime is 2604390247421. The reversal of 2604390247369 is 9637420934062.
2604390247369 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2182134612025 + 422255635344 = 1477205^2 + 649812^2 .
It is a cyclic number.
It is not a de Polignac number, because 2604390247369 - 219 = 2604389723081 is a prime.
It is a super-2 number, since 2×26043902473692 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2604390247339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1302195123684 + 1302195123685.
It is an arithmetic number, because the mean of its divisors is an integer number (1302195123685).
Almost surely, 22604390247369 is an apocalyptic number.
It is an amenable number.
2604390247369 is a deficient number, since it is larger than the sum of its proper divisors (1).
2604390247369 is an equidigital number, since it uses as much as digits as its factorization.
2604390247369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11757312, while the sum is 55.
The spelling of 2604390247369 in words is "two trillion, six hundred four billion, three hundred ninety million, two hundred forty-seven thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •