Base | Representation |
---|---|
bin | 1010000001110101100111… |
… | …0111110010110010011001 |
3 | 1110001010210220102120200021 |
4 | 2200131121313302302121 |
5 | 2421130124321101001 |
6 | 35241331350110441 |
7 | 2215436425506022 |
oct | 240353167626231 |
9 | 43033726376607 |
10 | 11026688847001 |
11 | 3571435430763 |
12 | 12a106794b421 |
13 | 61ca73800509 |
14 | 2a19a1d3dc49 |
15 | 141c6977aba1 |
hex | a0759df2c99 |
11026688847001 has 8 divisors (see below), whose sum is σ = 11607283579680. Its totient is φ = 10446118383168.
The previous prime is 11026688846993. The next prime is 11026688847059. The reversal of 11026688847001 is 10074888662011.
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 11026688847001 - 23 = 11026688846993 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11026688847001.
It is not an unprimeable number, because it can be changed into a prime (11026638847001) 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 7 ways as a sum of consecutive naturals, for example, 5130871 + ... + 6955516.
It is an arithmetic number, because the mean of its divisors is an integer number (1450910447460).
Almost surely, 211026688847001 is an apocalyptic number.
It is an amenable number.
11026688847001 is a deficient number, since it is larger than the sum of its proper divisors (580594732679).
11026688847001 is a wasteful number, since it uses less digits than its factorization.
11026688847001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12134423.
The product of its (nonzero) digits is 1032192, while the sum is 52.
The spelling of 11026688847001 in words is "eleven trillion, twenty-six billion, six hundred eighty-eight million, eight hundred forty-seven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •