Base | Representation |
---|---|
bin | 1010011010101001101001 |
3 | 12010201200101 |
4 | 22122221221 |
5 | 1144334401 |
6 | 134305401 |
7 | 32131636 |
oct | 12325151 |
9 | 5121611 |
10 | 2730601 |
11 | 15a55a5 |
12 | ab8261 |
13 | 747b53 |
14 | 51118d |
15 | 38e101 |
hex | 29aa69 |
2730601 has 2 divisors, whose sum is σ = 2730602. Its totient is φ = 2730600.
The previous prime is 2730599. The next prime is 2730643. The reversal of 2730601 is 1060372.
2730601 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., 1893376 + 837225 = 1376^2 + 915^2 .
It is a cyclic number.
It is not a de Polignac number, because 2730601 - 21 = 2730599 is a prime.
Together with 2730599, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2730671) 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, 1365300 + 1365301.
It is an arithmetic number, because the mean of its divisors is an integer number (1365301).
22730601 is an apocalyptic number.
It is an amenable number.
2730601 is a deficient number, since it is larger than the sum of its proper divisors (1).
2730601 is an equidigital number, since it uses as much as digits as its factorization.
2730601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 19.
The square root of 2730601 is about 1652.4530250509. The cubic root of 2730601 is about 139.7717539364.
Adding to 2730601 its reverse (1060372), we get a palindrome (3790973).
It can be divided in two parts, 27 and 30601, that added together give a triangular number (30628 = T247).
The spelling of 2730601 in words is "two million, seven hundred thirty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •