Base | Representation |
---|---|
bin | 1010000000010110010101… |
… | …0101010010011011110001 |
3 | 1102221200210100210210210102 |
4 | 2200011211111102123301 |
5 | 2420220233444340101 |
6 | 35221501335042145 |
7 | 2213542536243212 |
oct | 240054525223361 |
9 | 42850710723712 |
10 | 11001111324401 |
11 | 35615aa5a9430 |
12 | 1298109b10355 |
13 | 61a52873b363 |
14 | 2a0656dc1409 |
15 | 14126e02a86b |
hex | a01655526f1 |
11001111324401 has 64 divisors (see below), whose sum is σ = 13660218950400. Its totient is φ = 8729791488000.
The previous prime is 11001111324341. The next prime is 11001111324409. The reversal of 11001111324401 is 10442311110011.
It is not a de Polignac number, because 11001111324401 - 226 = 11001044215537 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11001111324409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 31765691 + ... + 32110143.
It is an arithmetic number, because the mean of its divisors is an integer number (213440921100).
Almost surely, 211001111324401 is an apocalyptic number.
11001111324401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11001111324401 is a deficient number, since it is larger than the sum of its proper divisors (2659107625999).
11001111324401 is a wasteful number, since it uses less digits than its factorization.
11001111324401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 344690.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 11001111324401 its reverse (10442311110011), we get a palindrome (21443422434412).
The spelling of 11001111324401 in words is "eleven trillion, one billion, one hundred eleven million, three hundred twenty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •