Base | Representation |
---|---|
bin | 1010100001111111000010 |
3 | 12012020220000 |
4 | 22201333002 |
5 | 1201320032 |
6 | 135100430 |
7 | 32315343 |
oct | 12417702 |
9 | 5166800 |
10 | 2760642 |
11 | 1616125 |
12 | b11716 |
13 | 758721 |
14 | 51c0ca |
15 | 397e7c |
hex | 2a1fc2 |
2760642 has 20 divisors (see below), whose sum is σ = 6186246. Its totient is φ = 920160.
The previous prime is 2760631. The next prime is 2760649. The reversal of 2760642 is 2460672.
2760642 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 1798281 + 962361 = 1341^2 + 981^2 .
It is a super-2 number, since 2×27606422 = 15242288504328, which contains 22 as substring.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (2760649) 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 in 9 ways as a sum of consecutive naturals, for example, 8359 + ... + 8682.
22760642 is an apocalyptic number.
2760642 is an abundant number, since it is smaller than the sum of its proper divisors (3425604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2760642 is a wasteful number, since it uses less digits than its factorization.
2760642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17055 (or 17046 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 27.
The square root of 2760642 is about 1661.5179806430. The cubic root of 2760642 is about 140.2824569567.
The spelling of 2760642 in words is "two million, seven hundred sixty thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •