Base | Representation |
---|---|
bin | 1001101100111011… |
… | …0110001111000001 |
3 | 20201111120020011112 |
4 | 2123032312033001 |
5 | 20313204020031 |
6 | 1110232253105 |
7 | 121352462111 |
oct | 23316661701 |
9 | 6644506145 |
10 | 2604360641 |
11 | 1117103773 |
12 | 608241195 |
13 | 32673b9cc |
14 | 1a9c59041 |
15 | 10399262b |
hex | 9b3b63c1 |
2604360641 has 2 divisors, whose sum is σ = 2604360642. Its totient is φ = 2604360640.
The previous prime is 2604360593. The next prime is 2604360683. The reversal of 2604360641 is 1460634062.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2399040400 + 205320241 = 48980^2 + 14329^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2604360641 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2604360598 and 2604360607.
It is not a weakly prime, because it can be changed into another prime (2604366641) 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, 1302180320 + 1302180321.
It is an arithmetic number, because the mean of its divisors is an integer number (1302180321).
Almost surely, 22604360641 is an apocalyptic number.
It is an amenable number.
2604360641 is a deficient number, since it is larger than the sum of its proper divisors (1).
2604360641 is an equidigital number, since it uses as much as digits as its factorization.
2604360641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 32.
The square root of 2604360641 is about 51032.9368251524. The cubic root of 2604360641 is about 1375.8371789453.
The spelling of 2604360641 in words is "two billion, six hundred four million, three hundred sixty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •