Base | Representation |
---|---|
bin | 10000000000101001110… |
… | …000000110001111101001 |
3 | 10220011211200011200010212 |
4 | 100000221300012033221 |
5 | 121011213244231441 |
6 | 2201232551350505 |
7 | 142326165365036 |
oct | 20005160061751 |
9 | 3804750150125 |
10 | 1100212102121 |
11 | 39466305a500 |
12 | 15928a982435 |
13 | 7c998a0bba2 |
14 | 3b37171a38d |
15 | 1d9443eaeeb |
hex | 10029c063e9 |
1100212102121 has 48 divisors (see below), whose sum is σ = 1256797651200. Its totient is φ = 961260410880.
The previous prime is 1100212102091. The next prime is 1100212102153. The reversal of 1100212102121 is 1212012120011.
It is not a de Polignac number, because 1100212102121 - 218 = 1100211839977 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100212102096 and 1100212102105.
It is not an unprimeable number, because it can be changed into a prime (1100212102421) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1058913920 + ... + 1058914958.
It is an arithmetic number, because the mean of its divisors is an integer number (26183284400).
Almost surely, 21100212102121 is an apocalyptic number.
1100212102121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1100212102121 is a deficient number, since it is larger than the sum of its proper divisors (156585549079).
1100212102121 is a wasteful number, since it uses less digits than its factorization.
1100212102121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2190 (or 2179 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1100212102121 its reverse (1212012120011), we get a palindrome (2312224222132).
The spelling of 1100212102121 in words is "one trillion, one hundred billion, two hundred twelve million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •