Base | Representation |
---|---|
bin | 1010000111010001001110… |
… | …1101110010110011010101 |
3 | 1110101001122222220020010010 |
4 | 2201310103231302303111 |
5 | 2424142230240213023 |
6 | 35352242531350433 |
7 | 2225251664542560 |
oct | 241642355626325 |
9 | 43331588806103 |
10 | 11120001101013 |
11 | 35a7a697a6262 |
12 | 12b7169a52419 |
13 | 6287c49055bc |
14 | 2a62d4ac74d7 |
15 | 1443cb7cb093 |
hex | a1d13b72cd5 |
11120001101013 has 16 divisors (see below), whose sum is σ = 16968330731520. Its totient is φ = 6345448662576.
The previous prime is 11120001101003. The next prime is 11120001101101. The reversal of 11120001101013 is 31010110002111.
It is not a de Polignac number, because 11120001101013 - 216 = 11120001035477 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11120001101013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120001101003) 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, 368221245 + ... + 368251442.
It is an arithmetic number, because the mean of its divisors is an integer number (1060520670720).
Almost surely, 211120001101013 is an apocalyptic number.
It is an amenable number.
11120001101013 is a deficient number, since it is larger than the sum of its proper divisors (5848329630507).
11120001101013 is an equidigital number, since it uses as much as digits as its factorization.
11120001101013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 736473416.
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 11120001101013 its reverse (31010110002111), we get a palindrome (42130111103124).
The spelling of 11120001101013 in words is "eleven trillion, one hundred twenty billion, one million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •