Base | Representation |
---|---|
bin | 10000001010111001111… |
… | …100000110000111010011 |
3 | 10221020020220112202112111 |
4 | 100022321330012013103 |
5 | 121201240100213021 |
6 | 2210253220410151 |
7 | 143166044340520 |
oct | 20127174060723 |
9 | 3836226482474 |
10 | 1111221101011 |
11 | 3992a238429a |
12 | 15b441846957 |
13 | 80a31767508 |
14 | 3bad7890147 |
15 | 1dd8ab668e1 |
hex | 102b9f061d3 |
1111221101011 has 8 divisors (see below), whose sum is σ = 1271658013184. Its totient is φ = 951206949000.
The previous prime is 1111221100963. The next prime is 1111221101017. The reversal of 1111221101011 is 1101011221111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1111221101011 - 29 = 1111221100499 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1111221100982 and 1111221101000.
It is not an unprimeable number, because it can be changed into a prime (1111221101017) 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, 105684405 + ... + 105694918.
It is an arithmetic number, because the mean of its divisors is an integer number (158957251648).
Almost surely, 21111221101011 is an apocalyptic number.
1111221101011 is a deficient number, since it is larger than the sum of its proper divisors (160436912173).
1111221101011 is an equidigital number, since it uses as much as digits as its factorization.
1111221101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211380081.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1111221101011 its reverse (1101011221111), we get a palindrome (2212232322122).
The spelling of 1111221101011 in words is "one trillion, one hundred eleven billion, two hundred twenty-one million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •