Base | Representation |
---|---|
bin | 10000000010010100010… |
… | …100011101111001110111 |
3 | 10220100110021110100220201 |
4 | 100002110110131321313 |
5 | 121023344001133421 |
6 | 2202130220541331 |
7 | 142421405424613 |
oct | 20022424357167 |
9 | 3810407410821 |
10 | 1102000021111 |
11 | 3953a0312500 |
12 | 1596a96b1847 |
13 | 7cbc225c112 |
14 | 3b4a0d6a343 |
15 | 1d9eb369b91 |
hex | 1009451de77 |
1102000021111 has 12 divisors (see below), whose sum is σ = 1211336708400. Its totient is φ = 1001778974240.
The previous prime is 1102000021097. The next prime is 1102000021127. The reversal of 1102000021111 is 1111200002011.
It is not a de Polignac number, because 1102000021111 - 27 = 1102000020983 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102000021151) 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 11 ways as a sum of consecutive naturals, for example, 3185910 + ... + 3514828.
It is an arithmetic number, because the mean of its divisors is an integer number (100944725700).
Almost surely, 21102000021111 is an apocalyptic number.
1102000021111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1102000021111 is a deficient number, since it is larger than the sum of its proper divisors (109336687289).
1102000021111 is a wasteful number, since it uses less digits than its factorization.
1102000021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356630 (or 356619 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1102000021111 its reverse (1111200002011), we get a palindrome (2213200023122).
The spelling of 1102000021111 in words is "one trillion, one hundred two billion, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •