Base | Representation |
---|---|
bin | 10000010110111010001… |
… | …111001101000100000111 |
3 | 10222110112020012002102000 |
4 | 100112322033031010013 |
5 | 121404134404341403 |
6 | 2220224240120343 |
7 | 144133342643322 |
oct | 20267217150407 |
9 | 3873466162360 |
10 | 1124111012103 |
11 | 3a38073a7282 |
12 | 161a3a6060b3 |
13 | 820070a2541 |
14 | 3c59b75d7b9 |
15 | 1e3925be7a3 |
hex | 105ba3cd107 |
1124111012103 has 16 divisors (see below), whose sum is σ = 1668129888000. Its totient is φ = 748156233240.
The previous prime is 1124111012099. The next prime is 1124111012107. The reversal of 1124111012103 is 3012101114211.
It is an interprime number because it is at equal distance from previous prime (1124111012099) and next prime (1124111012107).
It is not a de Polignac number, because 1124111012103 - 22 = 1124111012099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1124111012107) 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 15 ways as a sum of consecutive naturals, for example, 34736533 + ... + 34768878.
It is an arithmetic number, because the mean of its divisors is an integer number (104258118000).
Almost surely, 21124111012103 is an apocalyptic number.
1124111012103 is a deficient number, since it is larger than the sum of its proper divisors (544018875897).
1124111012103 is an equidigital number, since it uses as much as digits as its factorization.
1124111012103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69506019 (or 69506013 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 1124111012103 its reverse (3012101114211), we get a palindrome (4136212126314).
The spelling of 1124111012103 in words is "one trillion, one hundred twenty-four billion, one hundred eleven million, twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •