Base | Representation |
---|---|
bin | 10000000000101001101… |
… | …000111010111111010011 |
3 | 10220011211112122002202010 |
4 | 100000221220322333103 |
5 | 121011212304033021 |
6 | 2201232443154003 |
7 | 142326143401536 |
oct | 20005150727723 |
9 | 3804745562663 |
10 | 1100210221011 |
11 | 394661a95170 |
12 | 15928a215903 |
13 | 7c9985008c5 |
14 | 3b37138aa1d |
15 | 1d944178976 |
hex | 10029a3afd3 |
1100210221011 has 8 divisors (see below), whose sum is σ = 1600305776064. Its totient is φ = 666794073320.
The previous prime is 1100210221003. The next prime is 1100210221013. The reversal of 1100210221011 is 1101220120011.
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 1100210221011 - 23 = 1100210221003 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1100210221013) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 16669851801 + ... + 16669851866.
It is an arithmetic number, because the mean of its divisors is an integer number (200038222008).
Almost surely, 21100210221011 is an apocalyptic number.
1100210221011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1100210221011 is a deficient number, since it is larger than the sum of its proper divisors (500095555053).
1100210221011 is a wasteful number, since it uses less digits than its factorization.
1100210221011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33339703681.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1100210221011 its reverse (1101220120011), we get a palindrome (2201430341022).
The spelling of 1100210221011 in words is "one trillion, one hundred billion, two hundred ten million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •