Base | Representation |
---|---|
bin | 10000001001110111110… |
… | …001011110011111010011 |
3 | 10221010101112201212001102 |
4 | 100021313301132133103 |
5 | 121142001410133021 |
6 | 2205551123455015 |
7 | 143126404662626 |
oct | 20116761363723 |
9 | 3833345655042 |
10 | 1110111021011 |
11 | 398882804803 |
12 | 15b191b2746b |
13 | 808b5797745 |
14 | 3ba30289dbd |
15 | 1dd2348e00b |
hex | 10277c5e7d3 |
1110111021011 has 4 divisors (see below), whose sum is σ = 1110149836224. Its totient is φ = 1110072205800.
The previous prime is 1110111020989. The next prime is 1110111021023. The reversal of 1110111021011 is 1101201110111.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1110111021011 - 210 = 1110111019987 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110111020983 and 1110111021001.
It is not an unprimeable number, because it can be changed into a prime (1110111021031) 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, 19364675 + ... + 19421916.
It is an arithmetic number, because the mean of its divisors is an integer number (277537459056).
Almost surely, 21110111021011 is an apocalyptic number.
1110111021011 is a deficient number, since it is larger than the sum of its proper divisors (38815213).
1110111021011 is an equidigital number, since it uses as much as digits as its factorization.
1110111021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38815212.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 1110111021011 its reverse (1101201110111), we get a palindrome (2211312131122).
The spelling of 1110111021011 in words is "one trillion, one hundred ten billion, one hundred eleven million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •