Base | Representation |
---|---|
bin | 110000000000111100… |
… | …1101011010110100101 |
3 | 100212010222202012201211 |
4 | 1200001321223112211 |
5 | 3142132421041401 |
6 | 115211340551421 |
7 | 10310121664114 |
oct | 1400171532645 |
9 | 325128665654 |
10 | 103111112101 |
11 | 3a802597728 |
12 | 17b97852571 |
13 | 995322858a |
14 | 4dc230bc7b |
15 | 2a3742a951 |
hex | 1801e6b5a5 |
103111112101 has 2 divisors, whose sum is σ = 103111112102. Its totient is φ = 103111112100.
The previous prime is 103111112059. The next prime is 103111112149. The reversal of 103111112101 is 101211111301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102496022500 + 615089601 = 320150^2 + 24801^2 .
It is an emirp because it is prime and its reverse (101211111301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103111112101 - 27 = 103111111973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103111112191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51555556050 + 51555556051.
It is an arithmetic number, because the mean of its divisors is an integer number (51555556051).
Almost surely, 2103111112101 is an apocalyptic number.
It is an amenable number.
103111112101 is a deficient number, since it is larger than the sum of its proper divisors (1).
103111112101 is an equidigital number, since it uses as much as digits as its factorization.
103111112101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 103111112101 its reverse (101211111301), we get a palindrome (204322223402).
The spelling of 103111112101 in words is "one hundred three billion, one hundred eleven million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •