Base | Representation |
---|---|
bin | 111101010001010… |
… | …0101000001011101 |
3 | 12022021111202212221 |
4 | 1322202211001131 |
5 | 13202301304033 |
6 | 540000425341 |
7 | 101642506336 |
oct | 17242450135 |
9 | 5267452787 |
10 | 2055884893 |
11 | 965547827 |
12 | 494618251 |
13 | 269c1324a |
14 | 15708528d |
15 | c075112d |
hex | 7a8a505d |
2055884893 has 4 divisors (see below), whose sum is σ = 2094675228. Its totient is φ = 2017094560.
The previous prime is 2055884869. The next prime is 2055884903. The reversal of 2055884893 is 3984885502.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1602961369 + 452923524 = 40037^2 + 21282^2 .
It is a cyclic number.
It is not a de Polignac number, because 2055884893 - 221 = 2053787741 is a prime.
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 2055884893.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2055884813) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19395088 + ... + 19395193.
It is an arithmetic number, because the mean of its divisors is an integer number (523668807).
Almost surely, 22055884893 is an apocalyptic number.
It is an amenable number.
2055884893 is a deficient number, since it is larger than the sum of its proper divisors (38790335).
2055884893 is an equidigital number, since it uses as much as digits as its factorization.
2055884893 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38790334.
The product of its (nonzero) digits is 2764800, while the sum is 52.
The square root of 2055884893 is about 45341.8668892228. The cubic root of 2055884893 is about 1271.5485054674.
The spelling of 2055884893 in words is "two billion, fifty-five million, eight hundred eighty-four thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •