Base | Representation |
---|---|
bin | 11001000000110110110011… |
… | …101000001010000100001111 |
3 | 112102111212001211000022220201 |
4 | 121000312303220022010033 |
5 | 103404401000304013403 |
6 | 1025545522410154331 |
7 | 32112650424600643 |
oct | 3100666350120417 |
9 | 472455054008821 |
10 | 110010011001103 |
11 | 32063a90289524 |
12 | 104088161229a7 |
13 | 494cb90341055 |
14 | 1d24727728c23 |
15 | cab92d54521d |
hex | 640db3a0a10f |
110010011001103 has 2 divisors, whose sum is σ = 110010011001104. Its totient is φ = 110010011001102.
The previous prime is 110010011001097. The next prime is 110010011001113. The reversal of 110010011001103 is 301100110010011.
It is an a-pointer prime, because the next prime (110010011001113) can be obtained adding 110010011001103 to its sum of digits (10).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110010011001103 - 217 = 110010010870031 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110010011001103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110010011001113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005005500551 + 55005005500552.
It is an arithmetic number, because the mean of its divisors is an integer number (55005005500552).
Almost surely, 2110010011001103 is an apocalyptic number.
110010011001103 is a deficient number, since it is larger than the sum of its proper divisors (1).
110010011001103 is an equidigital number, since it uses as much as digits as its factorization.
110010011001103 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 110010011001103 its reverse (301100110010011), we get a palindrome (411110121011114).
The spelling of 110010011001103 in words is "one hundred ten trillion, ten billion, eleven million, one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •