Base | Representation |
---|---|
bin | 10111011111011000000011… |
… | …100000001100101010010101 |
3 | 111112210110021022020222122122 |
4 | 113133120003200030222111 |
5 | 102020122320220010401 |
6 | 1003420302215305325 |
7 | 30521662616531066 |
oct | 2737300340145225 |
9 | 445713238228578 |
10 | 103311202110101 |
11 | 2aa11042301287 |
12 | b7064a067b245 |
13 | 458528754495b |
14 | 1b724088cc56d |
15 | be2564d8621b |
hex | 5df60380ca95 |
103311202110101 has 16 divisors (see below), whose sum is σ = 105301256601600. Its totient is φ = 101339676966528.
The previous prime is 103311202110023. The next prime is 103311202110121. The reversal of 103311202110101 is 101011202113301.
It is a cyclic number.
It is not a de Polignac number, because 103311202110101 - 238 = 103036324203157 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103311202110101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103311202110121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 184173611 + ... + 184733703.
It is an arithmetic number, because the mean of its divisors is an integer number (6581328537600).
Almost surely, 2103311202110101 is an apocalyptic number.
It is an amenable number.
103311202110101 is a deficient number, since it is larger than the sum of its proper divisors (1990054491499).
103311202110101 is a wasteful number, since it uses less digits than its factorization.
103311202110101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 576628.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 103311202110101 its reverse (101011202113301), we get a palindrome (204322404223402).
The spelling of 103311202110101 in words is "one hundred three trillion, three hundred eleven billion, two hundred two million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •