Base | Representation |
---|---|
bin | 1001001100100010110010… |
… | …0101110000101100111111 |
3 | 1022210121112000120110200011 |
4 | 2103020230211300230333 |
5 | 2311130013341023403 |
6 | 33300550431244051 |
7 | 2062334340246226 |
oct | 223105445605477 |
9 | 38717460513604 |
10 | 10111101111103 |
11 | 3249103a88203 |
12 | 1173723379627 |
13 | 58461b804a55 |
14 | 26d54665dcbd |
15 | 12802da40a6d |
hex | 9322c970b3f |
10111101111103 has 2 divisors, whose sum is σ = 10111101111104. Its totient is φ = 10111101111102.
The previous prime is 10111101111073. The next prime is 10111101111107. The reversal of 10111101111103 is 30111110111101.
It is a happy number.
10111101111103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10111101111103 - 229 = 10110564240191 is a prime.
It is a super-2 number, since 2×101111011111032 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111101111107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055550555551 + 5055550555552.
It is an arithmetic number, because the mean of its divisors is an integer number (5055550555552).
Almost surely, 210111101111103 is an apocalyptic number.
10111101111103 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111101111103 is an equidigital number, since it uses as much as digits as its factorization.
10111101111103 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 13.
Adding to 10111101111103 its reverse (30111110111101), we get a palindrome (40222211222204).
The spelling of 10111101111103 in words is "ten trillion, one hundred eleven billion, one hundred one million, one hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •