Base | Representation |
---|---|
bin | 111110111111010… |
… | …0100101011000101 |
3 | 12110022000201121001 |
4 | 1331332210223011 |
5 | 13312032231031 |
6 | 545420453301 |
7 | 103242631225 |
oct | 17576445305 |
9 | 5408021531 |
10 | 2113555141 |
11 | 995057295 |
12 | 4ab9aa231 |
13 | 278b55959 |
14 | 1609b8085 |
15 | c5843861 |
hex | 7dfa4ac5 |
2113555141 has 8 divisors (see below), whose sum is σ = 2243205144. Its totient is φ = 1984496640.
The previous prime is 2113555127. The next prime is 2113555211. The reversal of 2113555141 is 1415553112.
It can be written as a sum of positive squares in 4 ways, for example, as 93412225 + 2020142916 = 9665^2 + 44946^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 2113555141 - 25 = 2113555109 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 (2113559141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 140500 + ... + 154813.
It is an arithmetic number, because the mean of its divisors is an integer number (280400643).
Almost surely, 22113555141 is an apocalyptic number.
It is an amenable number.
2113555141 is a deficient number, since it is larger than the sum of its proper divisors (129650003).
2113555141 is a wasteful number, since it uses less digits than its factorization.
2113555141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295751.
The product of its digits is 3000, while the sum is 28.
The square root of 2113555141 is about 45973.4177650520. The cubic root of 2113555141 is about 1283.3285643420.
The spelling of 2113555141 in words is "two billion, one hundred thirteen million, five hundred fifty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •