Base | Representation |
---|---|
bin | 10000000000011101000… |
… | …111000000010000011101 |
3 | 10220011021220001220222121 |
4 | 100000131013000100131 |
5 | 121010300000044401 |
6 | 2201155533342541 |
7 | 142321011516406 |
oct | 20003507002035 |
9 | 3804256056877 |
10 | 1100000003101 |
11 | 39456436335a |
12 | 15922b937a51 |
13 | 7c963aa97cc |
14 | 3b3514a89ad |
15 | 1d9309a1ca1 |
hex | 1001d1c041d |
1100000003101 has 2 divisors, whose sum is σ = 1100000003102. Its totient is φ = 1100000003100.
The previous prime is 1100000003059. The next prime is 1100000003119. The reversal of 1100000003101 is 1013000000011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1091627936100 + 8372067001 = 1044810^2 + 91499^2 .
It is an emirp because it is prime and its reverse (1013000000011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1100000003101 - 217 = 1099999872029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1100000003131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550000001550 + 550000001551.
It is an arithmetic number, because the mean of its divisors is an integer number (550000001551).
Almost surely, 21100000003101 is an apocalyptic number.
It is an amenable number.
1100000003101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100000003101 is an equidigital number, since it uses as much as digits as its factorization.
1100000003101 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 7.
Adding to 1100000003101 its reverse (1013000000011), we get a palindrome (2113000003112).
The spelling of 1100000003101 in words is "one trillion, one hundred billion, three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •