Base | Representation |
---|---|
bin | 1001101100111011… |
… | …0111101100110001 |
3 | 20201111120112101202 |
4 | 2123032313230301 |
5 | 20313204213031 |
6 | 1110232340545 |
7 | 121352515442 |
oct | 23316675461 |
9 | 6644515352 |
10 | 2604366641 |
11 | 1117108228 |
12 | 608244755 |
13 | 326741666 |
14 | 1a9c5b2c9 |
15 | 1039942cb |
hex | 9b3b7b31 |
2604366641 has 2 divisors, whose sum is σ = 2604366642. Its totient is φ = 2604366640.
The previous prime is 2604366631. The next prime is 2604366643. The reversal of 2604366641 is 1466634062.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2580640000 + 23726641 = 50800^2 + 4871^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2604366641 is a prime.
Together with 2604366643, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2604366595 and 2604366604.
It is not a weakly prime, because it can be changed into another prime (2604366643) 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, 1302183320 + 1302183321.
It is an arithmetic number, because the mean of its divisors is an integer number (1302183321).
Almost surely, 22604366641 is an apocalyptic number.
It is an amenable number.
2604366641 is a deficient number, since it is larger than the sum of its proper divisors (1).
2604366641 is an equidigital number, since it uses as much as digits as its factorization.
2604366641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 124416, while the sum is 38.
The square root of 2604366641 is about 51032.9956106831. The cubic root of 2604366641 is about 1375.8382355087.
The spelling of 2604366641 in words is "two billion, six hundred four million, three hundred sixty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •