Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …011111000001111011111 |
3 | 10220020220021120122111101 |
4 | 100001121103320033133 |
5 | 121014332030323403 |
6 | 2201444053333531 |
7 | 142355024452222 |
oct | 20013123701737 |
9 | 3806807518441 |
10 | 1101010011103 |
11 | 394a324a2312 |
12 | 1594720372a7 |
13 | 7ca9510c092 |
14 | 3b40969d5b9 |
15 | 1d98e4ad71d |
hex | 100594f83df |
1101010011103 has 2 divisors, whose sum is σ = 1101010011104. Its totient is φ = 1101010011102.
The previous prime is 1101010011071. The next prime is 1101010011113. The reversal of 1101010011103 is 3011100101011.
It is an a-pointer prime, because the next prime (1101010011113) can be obtained adding 1101010011103 to its sum of digits (10).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1101010011103 - 25 = 1101010011071 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1101010011103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101010011113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550505005551 + 550505005552.
It is an arithmetic number, because the mean of its divisors is an integer number (550505005552).
Almost surely, 21101010011103 is an apocalyptic number.
1101010011103 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101010011103 is an equidigital number, since it uses as much as digits as its factorization.
1101010011103 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 1101010011103 its reverse (3011100101011), we get a palindrome (4112110112114).
The spelling of 1101010011103 in words is "one trillion, one hundred one billion, ten million, eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •