Base | Representation |
---|---|
bin | 1010110101100101000101 |
3 | 12100022222120 |
4 | 22311211011 |
5 | 1211402101 |
6 | 140520153 |
7 | 33101340 |
oct | 12654505 |
9 | 5308876 |
10 | 2840901 |
11 | 1670458 |
12 | b50059 |
13 | 78610b |
14 | 53d457 |
15 | 3b1b36 |
hex | 2b5945 |
2840901 has 8 divisors (see below), whose sum is σ = 4329024. Its totient is φ = 1623360.
The previous prime is 2840857. The next prime is 2840911. The reversal of 2840901 is 1090482.
2840901 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 2840901 - 211 = 2838853 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2840911) 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, 67620 + ... + 67661.
It is an arithmetic number, because the mean of its divisors is an integer number (541128).
22840901 is an apocalyptic number.
2840901 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2840901 is a deficient number, since it is larger than the sum of its proper divisors (1488123).
2840901 is a wasteful number, since it uses less digits than its factorization.
2840901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135291.
The product of its (nonzero) digits is 576, while the sum is 24.
The square root of 2840901 is about 1685.4972560049. The cubic root of 2840901 is about 141.6289492823.
It can be divided in two parts, 2840 and 901, that added together give a triangular number (3741 = T86).
The spelling of 2840901 in words is "two million, eight hundred forty thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •