Base | Representation |
---|---|
bin | 10000000000110000010… |
… | …100000101111000001101 |
3 | 10220012010100100021112212 |
4 | 100000300110011320031 |
5 | 121011424440413401 |
6 | 2201251523240205 |
7 | 142332003251234 |
oct | 20006024057015 |
9 | 3805110307485 |
10 | 1100322201101 |
11 | 39470a2194a2 |
12 | 1592bb819065 |
13 | 7c9b577a306 |
14 | 3b3821b9b1b |
15 | 1d94dde7dbb |
hex | 10030505e0d |
1100322201101 has 16 divisors (see below), whose sum is σ = 1111174568064. Its totient is φ = 1089527799744.
The previous prime is 1100322201061. The next prime is 1100322201107. The reversal of 1100322201101 is 1011022230011.
It is a cyclic number.
It is not a de Polignac number, because 1100322201101 - 234 = 1083142331917 is a prime.
It is a super-2 number, since 2×11003222011012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100322201107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65087816 + ... + 65104718.
It is an arithmetic number, because the mean of its divisors is an integer number (69448410504).
Almost surely, 21100322201101 is an apocalyptic number.
It is an amenable number.
1100322201101 is a deficient number, since it is larger than the sum of its proper divisors (10852366963).
1100322201101 is a wasteful number, since it uses less digits than its factorization.
1100322201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18580.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1100322201101 its reverse (1011022230011), we get a palindrome (2111344431112).
The spelling of 1100322201101 in words is "one trillion, one hundred billion, three hundred twenty-two million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •