Base | Representation |
---|---|
bin | 1011001110111010000001 |
3 | 12112121021210 |
4 | 23032322001 |
5 | 1223212031 |
6 | 143040333 |
7 | 34012650 |
oct | 13167201 |
9 | 5477253 |
10 | 2944641 |
11 | 1731397 |
12 | ba00a9 |
13 | 7c13bb |
14 | 569197 |
15 | 3d2746 |
hex | 2cee81 |
2944641 has 8 divisors (see below), whose sum is σ = 4487104. Its totient is φ = 1682640.
The previous prime is 2944637. The next prime is 2944657. The reversal of 2944641 is 1464492.
2944641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2944641 - 22 = 2944637 is a prime.
It is an Ulam number.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2944599 and 2944608.
It is not an unprimeable number, because it can be changed into a prime (2944681) 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, 70090 + ... + 70131.
It is an arithmetic number, because the mean of its divisors is an integer number (560888).
22944641 is an apocalyptic number.
2944641 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2944641 is a deficient number, since it is larger than the sum of its proper divisors (1542463).
2944641 is a wasteful number, since it uses less digits than its factorization.
2944641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140231.
The product of its digits is 6912, while the sum is 30.
The square root of 2944641 is about 1715.9956293651. The cubic root of 2944641 is about 143.3323159594.
The spelling of 2944641 in words is "two million, nine hundred forty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •