Base | Representation |
---|---|
bin | 1010101001001001110101 |
3 | 12020202011112 |
4 | 22221021311 |
5 | 1203240010 |
6 | 135444405 |
7 | 32500061 |
oct | 12511165 |
9 | 5222145 |
10 | 2790005 |
11 | 1636199 |
12 | b26705 |
13 | 768bba |
14 | 528aa1 |
15 | 3a1a05 |
hex | 2a9275 |
2790005 has 8 divisors (see below), whose sum is σ = 3373272. Its totient is φ = 2215168.
The previous prime is 2790001. The next prime is 2790019. The reversal of 2790005 is 5000972.
2790005 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 4 ways, for example, as 54289 + 2735716 = 233^2 + 1654^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2790005 - 22 = 2790001 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2790001) 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 7 ways as a sum of consecutive naturals, for example, 1352 + ... + 2721.
It is an arithmetic number, because the mean of its divisors is an integer number (421659).
22790005 is an apocalyptic number.
It is an amenable number.
2790005 is a deficient number, since it is larger than the sum of its proper divisors (583267).
2790005 is a wasteful number, since it uses less digits than its factorization.
2790005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4215.
The product of its (nonzero) digits is 630, while the sum is 23.
The square root of 2790005 is about 1670.3308055592. The cubic root of 2790005 is about 140.7780657604.
Adding to 2790005 its reverse (5000972), we get a palindrome (7790977).
The spelling of 2790005 in words is "two million, seven hundred ninety thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •