Base | Representation |
---|---|
bin | 1010000111010101000100… |
… | …0110100011010011011111 |
3 | 1110101011022202211120201121 |
4 | 2201311101012203103133 |
5 | 2424201332414020221 |
6 | 35352533041551411 |
7 | 2225316341545420 |
oct | 241652106432337 |
9 | 43334282746647 |
10 | 11121031001311 |
11 | 35a8448091630 |
12 | 12b73b6945567 |
13 | 62892a0b126a |
14 | 2a63917b9647 |
15 | 14443be16a41 |
hex | a1d511a34df |
11121031001311 has 32 divisors (see below), whose sum is σ = 14241668732928. Its totient is φ = 8433550556640.
The previous prime is 11121031001309. The next prime is 11121031001321. The reversal of 11121031001311 is 11310013012111.
11121031001311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11121031001311 - 21 = 11121031001309 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11121031001321) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12557685 + ... + 13414078.
It is an arithmetic number, because the mean of its divisors is an integer number (445052147904).
Almost surely, 211121031001311 is an apocalyptic number.
11121031001311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11121031001311 is a deficient number, since it is larger than the sum of its proper divisors (3120637731617).
11121031001311 is a wasteful number, since it uses less digits than its factorization.
11121031001311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25971931.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 11121031001311 its reverse (11310013012111), we get a palindrome (22431044013422).
The spelling of 11121031001311 in words is "eleven trillion, one hundred twenty-one billion, thirty-one million, one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •