Base | Representation |
---|---|
bin | 10000001001110111001… |
… | …011101000011001000111 |
3 | 10221010100212001211010101 |
4 | 100021313023220121013 |
5 | 121141441340200403 |
6 | 2205550131104531 |
7 | 143126224442662 |
oct | 20116713503107 |
9 | 3833325054111 |
10 | 1110101100103 |
11 | 398878149006 |
12 | 15b18a742147 |
13 | 808b3702b98 |
14 | 3ba2cc266d9 |
15 | 1dd2267e71d |
hex | 102772e8647 |
1110101100103 has 2 divisors, whose sum is σ = 1110101100104. Its totient is φ = 1110101100102.
The previous prime is 1110101100089. The next prime is 1110101100109. The reversal of 1110101100103 is 3010011010111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1110101100103 is a prime.
It is a super-2 number, since 2×11101011001032 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1110101100103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110101100109) 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 as a sum of consecutive naturals, namely, 555050550051 + 555050550052.
It is an arithmetic number, because the mean of its divisors is an integer number (555050550052).
Almost surely, 21110101100103 is an apocalyptic number.
1110101100103 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110101100103 is an equidigital number, since it uses as much as digits as its factorization.
1110101100103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 1110101100103 its reverse (3010011010111), we get a palindrome (4120112110214).
The spelling of 1110101100103 in words is "one trillion, one hundred ten billion, one hundred one million, one hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •