Base | Representation |
---|---|
bin | 111100110111000… |
… | …1001110110010111 |
3 | 12021022122120022201 |
4 | 1321232021312113 |
5 | 13140242021403 |
6 | 534350105331 |
7 | 101414631031 |
oct | 17156116627 |
9 | 5238576281 |
10 | 2042142103 |
11 | 958810651 |
12 | 48baab247 |
13 | 267110c11 |
14 | 155308c51 |
15 | be43921d |
hex | 79b89d97 |
2042142103 has 4 divisors (see below), whose sum is σ = 2046154680. Its totient is φ = 2038129528.
The previous prime is 2042142049. The next prime is 2042142127. The reversal of 2042142103 is 3012412402.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3012412402 = 2 ⋅1506206201.
It is a cyclic number.
It is not a de Polignac number, because 2042142103 - 213 = 2042133911 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 (2042142133) 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 3 ways as a sum of consecutive naturals, for example, 2005525 + ... + 2006542.
It is an arithmetic number, because the mean of its divisors is an integer number (511538670).
Almost surely, 22042142103 is an apocalyptic number.
2042142103 is a deficient number, since it is larger than the sum of its proper divisors (4012577).
2042142103 is an equidigital number, since it uses as much as digits as its factorization.
2042142103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4012576.
The product of its (nonzero) digits is 384, while the sum is 19.
The square root of 2042142103 is about 45190.0664195130. The cubic root of 2042142103 is about 1268.7088999345.
Adding to 2042142103 its reverse (3012412402), we get a palindrome (5054554505).
The spelling of 2042142103 in words is "two billion, forty-two million, one hundred forty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •