Base | Representation |
---|---|
bin | 111111000000011… |
… | …0011111110010111 |
3 | 12110100010112202101 |
4 | 1332000303332113 |
5 | 13312210021403 |
6 | 545441222531 |
7 | 103250624413 |
oct | 17600637627 |
9 | 5410115671 |
10 | 2114142103 |
11 | 995418287 |
12 | 4b0031a47 |
13 | 278cccb78 |
14 | 160acbd43 |
15 | c590c71d |
hex | 7e033f97 |
2114142103 has 8 divisors (see below), whose sum is σ = 2263132800. Its totient is φ = 1968923448.
The previous prime is 2114142101. The next prime is 2114142113. The reversal of 2114142103 is 3012414112.
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 2114142103 - 21 = 2114142101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2114142101) 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, 941851 + ... + 944092.
It is an arithmetic number, because the mean of its divisors is an integer number (282891600).
Almost surely, 22114142103 is an apocalyptic number.
2114142103 is a deficient number, since it is larger than the sum of its proper divisors (148990697).
2114142103 is a wasteful number, since it uses less digits than its factorization.
2114142103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1886021.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 2114142103 is about 45979.8010326274. The cubic root of 2114142103 is about 1283.4473524077.
Adding to 2114142103 its reverse (3012414112), we get a palindrome (5126556215).
The spelling of 2114142103 in words is "two billion, one hundred fourteen million, one hundred forty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •