Base | Representation |
---|---|
bin | 1010000110010010010001… |
… | …1101111111101101111101 |
3 | 1110022110001021211100100222 |
4 | 2201210210131333231331 |
5 | 2423403123142144401 |
6 | 35340410023431125 |
7 | 2224113140251304 |
oct | 241444435775575 |
9 | 43273037740328 |
10 | 11103102303101 |
11 | 35a088787a276 |
12 | 12b3a325b54a5 |
13 | 627030886bb3 |
14 | 2a557062d43b |
15 | 143c3ce44c1b |
hex | a192477fb7d |
11103102303101 has 2 divisors, whose sum is σ = 11103102303102. Its totient is φ = 11103102303100.
The previous prime is 11103102303091. The next prime is 11103102303119. The reversal of 11103102303101 is 10130320130111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11057626740601 + 45475562500 = 3325301^2 + 213250^2 .
It is a cyclic number.
It is not a de Polignac number, because 11103102303101 - 222 = 11103098108797 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11103102303101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11103102308101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551551151550 + 5551551151551.
It is an arithmetic number, because the mean of its divisors is an integer number (5551551151551).
Almost surely, 211103102303101 is an apocalyptic number.
It is an amenable number.
11103102303101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11103102303101 is an equidigital number, since it uses as much as digits as its factorization.
11103102303101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 11103102303101 its reverse (10130320130111), we get a palindrome (21233422433212).
The spelling of 11103102303101 in words is "eleven trillion, one hundred three billion, one hundred two million, three hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •