Base | Representation |
---|---|
bin | 111111000001000… |
… | …1110100011001111 |
3 | 12110100211101200010 |
4 | 1332002032203033 |
5 | 13312303404403 |
6 | 545453204303 |
7 | 103254031143 |
oct | 17602164317 |
9 | 5410741603 |
10 | 2114513103 |
11 | 995650a9a |
12 | 4b0190693 |
13 | 2790cc9b1 |
14 | 160b87223 |
15 | c5982603 |
hex | 7e08e8cf |
2114513103 has 4 divisors (see below), whose sum is σ = 2819350808. Its totient is φ = 1409675400.
The previous prime is 2114513083. The next prime is 2114513117. The reversal of 2114513103 is 3013154112.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2114513103 - 26 = 2114513039 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 2114513103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2114513123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 352418848 + ... + 352418853.
It is an arithmetic number, because the mean of its divisors is an integer number (704837702).
Almost surely, 22114513103 is an apocalyptic number.
2114513103 is a deficient number, since it is larger than the sum of its proper divisors (704837705).
2114513103 is an equidigital number, since it uses as much as digits as its factorization.
2114513103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 704837704.
The product of its (nonzero) digits is 360, while the sum is 21.
The square root of 2114513103 is about 45983.8352358739. The cubic root of 2114513103 is about 1283.5224232236.
Adding to 2114513103 its reverse (3013154112), we get a palindrome (5127667215).
The spelling of 2114513103 in words is "two billion, one hundred fourteen million, five hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •