Base | Representation |
---|---|
bin | 1010010011000110101100… |
… | …1000111111010110011001 |
3 | 1111002111111102120002220012 |
4 | 2210301223020333112121 |
5 | 2441010140303423001 |
6 | 40025511103411305 |
7 | 2246040464033603 |
oct | 244615310772631 |
9 | 44074442502805 |
10 | 11323331311001 |
11 | 367621a365516 |
12 | 132a6548b3b35 |
13 | 641a29b53518 |
14 | 2b20a31aa173 |
15 | 14982c2be2bb |
hex | a4c6b23f599 |
11323331311001 has 8 divisors (see below), whose sum is σ = 11416729580544. Its totient is φ = 11229999263280.
The previous prime is 11323331310971. The next prime is 11323331311007. The reversal of 11323331311001 is 10011313332311.
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 11323331311001 - 210 = 11323331309977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11323331311007) 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, 16212035 + ... + 16896056.
It is an arithmetic number, because the mean of its divisors is an integer number (1427091197568).
Almost surely, 211323331311001 is an apocalyptic number.
It is an amenable number.
11323331311001 is a deficient number, since it is larger than the sum of its proper divisors (93398269543).
11323331311001 is a wasteful number, since it uses less digits than its factorization.
11323331311001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33110911.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 11323331311001 its reverse (10011313332311), we get a palindrome (21334644643312).
The spelling of 11323331311001 in words is "eleven trillion, three hundred twenty-three billion, three hundred thirty-one million, three hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •