Base | Representation |
---|---|
bin | 10000000001011110110… |
… | …000010001111011000101 |
3 | 10220021010122102202111012 |
4 | 100001132300101323011 |
5 | 121020023420424110 |
6 | 2201501115052005 |
7 | 142360213661231 |
oct | 20013660217305 |
9 | 3807118382435 |
10 | 1101101342405 |
11 | 394a7a002929 |
12 | 159498741005 |
13 | 7caab008c7c |
14 | 3b4178755c1 |
15 | 1d9974ee905 |
hex | 1005ec11ec5 |
1101101342405 has 4 divisors (see below), whose sum is σ = 1321321610892. Its totient is φ = 880881073920.
The previous prime is 1101101342359. The next prime is 1101101342443. The reversal of 1101101342405 is 5042431011011.
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 757028765476 + 344072576929 = 870074^2 + 586577^2 .
It is not a de Polignac number, because 1101101342405 - 214 = 1101101326021 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 (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 110110134236 + ... + 110110134245.
It is an arithmetic number, because the mean of its divisors is an integer number (330330402723).
Almost surely, 21101101342405 is an apocalyptic number.
It is an amenable number.
1101101342405 is a deficient number, since it is larger than the sum of its proper divisors (220220268487).
1101101342405 is an equidigital number, since it uses as much as digits as its factorization.
1101101342405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220220268486.
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 1101101342405 its reverse (5042431011011), we get a palindrome (6143532353416).
The spelling of 1101101342405 in words is "one trillion, one hundred one billion, one hundred one million, three hundred forty-two thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •