Base | Representation |
---|---|
bin | 1010000110001110001011… |
… | …0001011011011011110111 |
3 | 1110022100012110211200111001 |
4 | 2201203202301123123313 |
5 | 2423343344011213421 |
6 | 35340104411424131 |
7 | 2224043624554363 |
oct | 241434261333367 |
9 | 43270173750431 |
10 | 11102000101111 |
11 | 35a03716a0637 |
12 | 12b3785455047 |
13 | 626bb6414b7a |
14 | 2a54a80ba2a3 |
15 | 143bc62c6691 |
hex | a18e2c5b6f7 |
11102000101111 has 8 divisors (see below), whose sum is σ = 11414746582848. Its totient is φ = 10791252000000.
The previous prime is 11102000101079. The next prime is 11102000101141. The reversal of 11102000101111 is 11110100020111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11102000101111 - 25 = 11102000101079 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102000101141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 499583890 + ... + 499606111.
It is an arithmetic number, because the mean of its divisors is an integer number (1426843322856).
Almost surely, 211102000101111 is an apocalyptic number.
11102000101111 is a deficient number, since it is larger than the sum of its proper divisors (312746481737).
11102000101111 is an equidigital number, since it uses as much as digits as its factorization.
11102000101111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 999190313.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 11102000101111 its reverse (11110100020111), we get a palindrome (22212100121222).
The spelling of 11102000101111 in words is "eleven trillion, one hundred two billion, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •