Base | Representation |
---|---|
bin | 1010010000111111000101 |
3 | 12001201101011 |
4 | 22100333011 |
5 | 1142103023 |
6 | 133402221 |
7 | 31605343 |
oct | 12207705 |
9 | 5051334 |
10 | 2691013 |
11 | 1578886 |
12 | a99371 |
13 | 732b20 |
14 | 500993 |
15 | 38250d |
hex | 290fc5 |
2691013 has 8 divisors (see below), whose sum is σ = 2911608. Its totient is φ = 2472384.
The previous prime is 2691011. The next prime is 2691019. The reversal of 2691013 is 3101962.
2691013 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 124609 + 2566404 = 353^2 + 1602^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 2691013 - 21 = 2691011 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2691011) 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, 3795 + ... + 4447.
It is an arithmetic number, because the mean of its divisors is an integer number (363951).
22691013 is an apocalyptic number.
It is an amenable number.
2691013 is a deficient number, since it is larger than the sum of its proper divisors (220595).
2691013 is a wasteful number, since it uses less digits than its factorization.
2691013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 983.
The product of its (nonzero) digits is 324, while the sum is 22.
The square root of 2691013 is about 1640.4307361178. The cubic root of 2691013 is about 139.0929971324.
Adding to 2691013 its reverse (3101962), we get a palindrome (5792975).
The spelling of 2691013 in words is "two million, six hundred ninety-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •