Base | Representation |
---|---|
bin | 11110101111000001111… |
… | …111100101111101110101 |
3 | 21110220122201221110121111 |
4 | 132233001333211331311 |
5 | 234101021401144410 |
6 | 4254140001515021 |
7 | 305410254342415 |
oct | 36570177457565 |
9 | 7426581843544 |
10 | 2112083615605 |
11 | 744803159167 |
12 | 2a1404642a71 |
13 | 124226633602 |
14 | 74322696645 |
15 | 39e17ea2b8a |
hex | 1ebc1fe5f75 |
2112083615605 has 4 divisors (see below), whose sum is σ = 2534500338732. Its totient is φ = 1689666892480.
The previous prime is 2112083615569. The next prime is 2112083615651. The reversal of 2112083615605 is 5065163802112.
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 1285246213969 + 826837401636 = 1133687^2 + 909306^2 .
It is not a de Polignac number, because 2112083615605 - 29 = 2112083615093 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 211208361556 + ... + 211208361565.
It is an arithmetic number, because the mean of its divisors is an integer number (633625084683).
Almost surely, 22112083615605 is an apocalyptic number.
It is an amenable number.
2112083615605 is a deficient number, since it is larger than the sum of its proper divisors (422416723127).
2112083615605 is an equidigital number, since it uses as much as digits as its factorization.
2112083615605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 422416723126.
The product of its (nonzero) digits is 86400, while the sum is 40.
The spelling of 2112083615605 in words is "two trillion, one hundred twelve billion, eighty-three million, six hundred fifteen thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •