Base | Representation |
---|---|
bin | 10000001011101001000… |
… | …001010111001111000011 |
3 | 10221022021221220100100102 |
4 | 100023221001113033003 |
5 | 121204344304323021 |
6 | 2210503435113015 |
7 | 143224445431235 |
oct | 20135101271703 |
9 | 3838257810312 |
10 | 1112011011011 |
11 | 39966825337a |
12 | 15b6222a276b |
13 | 80b292c6894 |
14 | 3bb70750255 |
15 | 1ddd519900b |
hex | 102e90573c3 |
1112011011011 has 4 divisors (see below), whose sum is σ = 1113208009800. Its totient is φ = 1110814012224.
The previous prime is 1112011010989. The next prime is 1112011011017. The reversal of 1112011011011 is 1101101102111.
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 1112011011011 - 230 = 1110937269187 is a prime.
It is a super-3 number, since 3×11120110110113 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1112011010983 and 1112011011001.
It is not an unprimeable number, because it can be changed into a prime (1112011011017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 598498001 + ... + 598499858.
It is an arithmetic number, because the mean of its divisors is an integer number (278302002450).
Almost surely, 21112011011011 is an apocalyptic number.
1112011011011 is a deficient number, since it is larger than the sum of its proper divisors (1196998789).
1112011011011 is an equidigital number, since it uses as much as digits as its factorization.
1112011011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1196998788.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 1112011011011 its reverse (1101101102111), we get a palindrome (2213112113122).
The spelling of 1112011011011 in words is "one trillion, one hundred twelve billion, eleven million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •