Base | Representation |
---|---|
bin | 11001000000110110110011… |
… | …000010011011100000111111 |
3 | 112102111212001010101212101102 |
4 | 121000312303002123200333 |
5 | 103404400440241023403 |
6 | 1025545521414203315 |
7 | 32112650244540062 |
oct | 3100666302334077 |
9 | 472455033355342 |
10 | 110010001111103 |
11 | 32063a85743a75 |
12 | 1040881295353b |
13 | 494cb8b28a592 |
14 | 1d247262b28d9 |
15 | cab92c73eb88 |
hex | 640db309b83f |
110010001111103 has 2 divisors, whose sum is σ = 110010001111104. Its totient is φ = 110010001111102.
The previous prime is 110010001111067. The next prime is 110010001111117. The reversal of 110010001111103 is 301111100010011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110010001111103 - 212 = 110010001107007 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110010001111403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005000555551 + 55005000555552.
It is an arithmetic number, because the mean of its divisors is an integer number (55005000555552).
Almost surely, 2110010001111103 is an apocalyptic number.
110010001111103 is a deficient number, since it is larger than the sum of its proper divisors (1).
110010001111103 is an equidigital number, since it uses as much as digits as its factorization.
110010001111103 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 11.
Adding to 110010001111103 its reverse (301111100010011), we get a palindrome (411121101121114).
The spelling of 110010001111103 in words is "one hundred ten trillion, ten billion, one million, one hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •