Base | Representation |
---|---|
bin | 1001011000101111100001 |
3 | 11122000100212 |
4 | 21120233201 |
5 | 1112220031 |
6 | 124423505 |
7 | 26625611 |
oct | 11305741 |
9 | 4560325 |
10 | 2460641 |
11 | 1430797 |
12 | 9a7b95 |
13 | 682001 |
14 | 480a41 |
15 | 33912b |
hex | 258be1 |
2460641 has 2 divisors, whose sum is σ = 2460642. Its totient is φ = 2460640.
The previous prime is 2460637. The next prime is 2460643. The reversal of 2460641 is 1460642.
It is a happy number.
2460641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1430416 + 1030225 = 1196^2 + 1015^2 .
It is a cyclic number.
It is not a de Polignac number, because 2460641 - 22 = 2460637 is a prime.
It is a Sophie Germain prime.
Together with 2460643, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2460643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1230320 + 1230321.
It is an arithmetic number, because the mean of its divisors is an integer number (1230321).
22460641 is an apocalyptic number.
It is an amenable number.
2460641 is a deficient number, since it is larger than the sum of its proper divisors (1).
2460641 is an equidigital number, since it uses as much as digits as its factorization.
2460641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
The square root of 2460641 is about 1568.6430441627. The cubic root of 2460641 is about 135.0048649367.
Subtracting from 2460641 its reverse (1460642), we obtain a palindrome (999999).
The spelling of 2460641 in words is "two million, four hundred sixty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •