Base | Representation |
---|---|
bin | 1010000001110011011110… |
… | …0100100110010001100111 |
3 | 1110001002022210121022121211 |
4 | 2200130313210212101213 |
5 | 2421122440011432141 |
6 | 35241154312052251 |
7 | 2215416240265612 |
oct | 240346744462147 |
9 | 43032283538554 |
10 | 11026113389671 |
11 | 357116a616096 |
12 | 12a0b27094087 |
13 | 61c9b1518913 |
14 | 2a1949745179 |
15 | 141c33ea9d81 |
hex | a0737926467 |
11026113389671 has 4 divisors (see below), whose sum is σ = 11026405038744. Its totient is φ = 11025821740600.
The previous prime is 11026113389663. The next prime is 11026113389693. The reversal of 11026113389671 is 17698331162011.
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 11026113389671 - 23 = 11026113389663 is a prime.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11026113389611) 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, 145767820 + ... + 145843441.
It is an arithmetic number, because the mean of its divisors is an integer number (2756601259686).
Almost surely, 211026113389671 is an apocalyptic number.
11026113389671 is a deficient number, since it is larger than the sum of its proper divisors (291649073).
11026113389671 is an equidigital number, since it uses as much as digits as its factorization.
11026113389671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291649072.
The product of its (nonzero) digits is 326592, while the sum is 49.
The spelling of 11026113389671 in words is "eleven trillion, twenty-six billion, one hundred thirteen million, three hundred eighty-nine thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •