Base | Representation |
---|---|
bin | 1010000010001101100111… |
… | …0111111101010011001001 |
3 | 1110001202102220010012000011 |
4 | 2200203121313331103021 |
5 | 2421231323110403001 |
6 | 35244314531111521 |
7 | 2216055165012250 |
oct | 240433167752311 |
9 | 43052386105004 |
10 | 11033131341001 |
11 | 3574141010870 |
12 | 12a23654425a1 |
13 | 62055c468643 |
14 | 2a2013815797 |
15 | 141ee516cd51 |
hex | a08d9dfd4c9 |
11033131341001 has 16 divisors (see below), whose sum is σ = 13847911747200. Its totient is φ = 8539545559680.
The previous prime is 11033131340993. The next prime is 11033131341007. The reversal of 11033131341001 is 10014313133011.
It is a cyclic number.
It is not a de Polignac number, because 11033131341001 - 23 = 11033131340993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11033131341007) 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 15 ways as a sum of consecutive naturals, for example, 480818796 + ... + 480841741.
It is an arithmetic number, because the mean of its divisors is an integer number (865494484200).
Almost surely, 211033131341001 is an apocalyptic number.
11033131341001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11033131341001 is a deficient number, since it is larger than the sum of its proper divisors (2814780406199).
11033131341001 is a wasteful number, since it uses less digits than its factorization.
11033131341001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 961660704.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 11033131341001 its reverse (10014313133011), we get a palindrome (21047444474012).
The spelling of 11033131341001 in words is "eleven trillion, thirty-three billion, one hundred thirty-one million, three hundred forty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •