Base | Representation |
---|---|
bin | 1010000111010110011101… |
… | …0011100110100111100111 |
3 | 1110101012021201210120101001 |
4 | 2201311213103212213213 |
5 | 2424203113300142021 |
6 | 35353034030214131 |
7 | 2225331514116223 |
oct | 241654723464747 |
9 | 43335251716331 |
10 | 11121403521511 |
11 | 35a8619398568 |
12 | 12b749b654347 |
13 | 628989320a0a |
14 | 2a63c9069783 |
15 | 14445e99d091 |
hex | a1d674e69e7 |
11121403521511 has 2 divisors, whose sum is σ = 11121403521512. Its totient is φ = 11121403521510.
The previous prime is 11121403521479. The next prime is 11121403521523. The reversal of 11121403521511 is 11512530412111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11121403521511 - 25 = 11121403521479 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11121403521511.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11121403521541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560701760755 + 5560701760756.
It is an arithmetic number, because the mean of its divisors is an integer number (5560701760756).
Almost surely, 211121403521511 is an apocalyptic number.
11121403521511 is a deficient number, since it is larger than the sum of its proper divisors (1).
11121403521511 is an equidigital number, since it uses as much as digits as its factorization.
11121403521511 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 28.
Adding to 11121403521511 its reverse (11512530412111), we get a palindrome (22633933933622).
The spelling of 11121403521511 in words is "eleven trillion, one hundred twenty-one billion, four hundred three million, five hundred twenty-one thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •