Base | Representation |
---|---|
bin | 10000000000011110010… |
… | …111111100011011110001 |
3 | 10220011100100222220121121 |
4 | 100000132113330123301 |
5 | 121010320413033410 |
6 | 2201202012222241 |
7 | 142321360050442 |
oct | 20003627743361 |
9 | 3804310886547 |
10 | 1100021221105 |
11 | 3945753357a4 |
12 | 159236a6a981 |
13 | 7c9682c8441 |
14 | 3b35422d2c9 |
15 | 1d9327939da |
hex | 1001e5fc6f1 |
1100021221105 has 8 divisors (see below), whose sum is σ = 1365543585000. Its totient is φ = 849671563776.
The previous prime is 1100021221081. The next prime is 1100021221129. The reversal of 1100021221105 is 5011221200011.
It is an interprime number because it is at equal distance from previous prime (1100021221081) and next prime (1100021221129).
It can be written as a sum of positive squares in 4 ways, for example, as 429900526224 + 670120694881 = 655668^2 + 818609^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1100021221105 - 25 = 1100021221073 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3793176480 + ... + 3793176769.
It is an arithmetic number, because the mean of its divisors is an integer number (170692948125).
Almost surely, 21100021221105 is an apocalyptic number.
It is an amenable number.
1100021221105 is a deficient number, since it is larger than the sum of its proper divisors (265522363895).
1100021221105 is an equidigital number, since it uses as much as digits as its factorization.
1100021221105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7586353283.
The product of its (nonzero) digits is 40, while the sum is 16.
Adding to 1100021221105 its reverse (5011221200011), we get a palindrome (6111242421116).
The spelling of 1100021221105 in words is "one trillion, one hundred billion, twenty-one million, two hundred twenty-one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •