Base | Representation |
---|---|
bin | 110011101111101010… |
… | …0111110101000110011 |
3 | 101121211012202201200001 |
4 | 1213133110332220303 |
5 | 3310033434013021 |
6 | 123014232410431 |
7 | 11012452631656 |
oct | 1473724765063 |
9 | 347735681601 |
10 | 111121001011 |
11 | 431429a9829 |
12 | 19652246a17 |
13 | a62b821807 |
14 | 554202b89d |
15 | 2d5572b091 |
hex | 19df53ea33 |
111121001011 has 4 divisors (see below), whose sum is σ = 111121738992. Its totient is φ = 111120263032.
The previous prime is 111121000967. The next prime is 111121001021. The reversal of 111121001011 is 110100121111.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 110100121111 = 242309 ⋅454379.
It is a cyclic number.
It is not a de Polignac number, because 111121001011 - 29 = 111121000499 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111121001021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52831 + ... + 474376.
It is an arithmetic number, because the mean of its divisors is an integer number (27780434748).
Almost surely, 2111121001011 is an apocalyptic number.
111121001011 is a deficient number, since it is larger than the sum of its proper divisors (737981).
111121001011 is an equidigital number, since it uses as much as digits as its factorization.
111121001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 737980.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 111121001011 its reverse (110100121111), we get a palindrome (221221122122).
The spelling of 111121001011 in words is "one hundred eleven billion, one hundred twenty-one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •