Base | Representation |
---|---|
bin | 111110101011010010101 |
3 | 10212100020222 |
4 | 13311122111 |
5 | 1011210111 |
6 | 112004125 |
7 | 23312462 |
oct | 7653225 |
9 | 3770228 |
10 | 2053781 |
11 | 1183044 |
12 | 830645 |
13 | 56ba72 |
14 | 3b6669 |
15 | 2a87db |
hex | 1f5695 |
2053781 has 8 divisors (see below), whose sum is σ = 2145024. Its totient is φ = 1964160.
The previous prime is 2053771. The next prime is 2053783. The reversal of 2053781 is 1873502.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2053781 - 218 = 1791637 is a prime.
It is a super-2 number, since 2×20537812 = 8436032791922, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2053781.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2053783) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2666 + ... + 3348.
It is an arithmetic number, because the mean of its divisors is an integer number (268128).
22053781 is an apocalyptic number.
It is an amenable number.
2053781 is a deficient number, since it is larger than the sum of its proper divisors (91243).
2053781 is an equidigital number, since it uses as much as digits as its factorization.
2053781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 811.
The product of its (nonzero) digits is 1680, while the sum is 26.
The square root of 2053781 is about 1433.1018805375. The cubic root of 2053781 is about 127.1114610378. Note that the first 3 decimals are identical.
It can be divided in two parts, 205378 and 1, that added together give a cube (205379 = 593).
The spelling of 2053781 in words is "two million, fifty-three thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •