Base | Representation |
---|---|
bin | 10000000000101001000… |
… | …110111011101111100101 |
3 | 10220011210220212102210022 |
4 | 100000221012323233211 |
5 | 121011203013424310 |
6 | 2201231524204525 |
7 | 142326004562453 |
oct | 20005106735745 |
9 | 3804726772708 |
10 | 1100201311205 |
11 | 394657a5a097 |
12 | 159287239745 |
13 | 7c996701329 |
14 | 3b37010b9d3 |
15 | 1d9434b8a55 |
hex | 100291bbbe5 |
1100201311205 has 4 divisors (see below), whose sum is σ = 1320241573452. Its totient is φ = 880161048960.
The previous prime is 1100201311171. The next prime is 1100201311259. The reversal of 1100201311205 is 5021131020011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 112994133316 + 987207177889 = 336146^2 + 993583^2 .
It is not a de Polignac number, because 1100201311205 - 26 = 1100201311141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 110020131116 + ... + 110020131125.
It is an arithmetic number, because the mean of its divisors is an integer number (330060393363).
Almost surely, 21100201311205 is an apocalyptic number.
It is an amenable number.
1100201311205 is a deficient number, since it is larger than the sum of its proper divisors (220040262247).
1100201311205 is an equidigital number, since it uses as much as digits as its factorization.
1100201311205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220040262246.
The product of its (nonzero) digits is 60, while the sum is 17.
Adding to 1100201311205 its reverse (5021131020011), we get a palindrome (6121332331216).
The spelling of 1100201311205 in words is "one trillion, one hundred billion, two hundred one million, three hundred eleven thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •