Base | Representation |
---|---|
bin | 10000000001011001100… |
… | …000000111111011110111 |
3 | 10220020220111121201210120 |
4 | 100001121200013323313 |
5 | 121014333341033421 |
6 | 2201444250223023 |
7 | 142355063651646 |
oct | 20013140077367 |
9 | 3806814551716 |
10 | 1101013221111 |
11 | 394a34295011 |
12 | 159473124a73 |
13 | 7ca959941ab |
14 | 3b409c9735d |
15 | 1d98e8e48c6 |
hex | 10059807ef7 |
1101013221111 has 8 divisors (see below), whose sum is σ = 1545281713920. Its totient is φ = 695376771192.
The previous prime is 1101013221103. The next prime is 1101013221169. The reversal of 1101013221111 is 1111223101011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1101013221111 - 23 = 1101013221103 is a prime.
It is a super-2 number, since 2×11010132211112 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101013228111) 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, 9658010655 + ... + 9658010768.
It is an arithmetic number, because the mean of its divisors is an integer number (193160214240).
Almost surely, 21101013221111 is an apocalyptic number.
1101013221111 is a deficient number, since it is larger than the sum of its proper divisors (444268492809).
1101013221111 is a wasteful number, since it uses less digits than its factorization.
1101013221111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19316021445.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 1101013221111 its reverse (1111223101011), we get a palindrome (2212236322122).
The spelling of 1101013221111 in words is "one trillion, one hundred one billion, thirteen million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •