Base | Representation |
---|---|
bin | 1010011101011111001000… |
… | …0100001101111010101001 |
3 | 1111201112212110100100121012 |
4 | 2213113302010031322221 |
5 | 3001420424243040431 |
6 | 40243445224153305 |
7 | 2264653365245066 |
oct | 247276204157251 |
9 | 44645773310535 |
10 | 11501688643241 |
11 | 3734925433035 |
12 | 1359130308835 |
13 | 6557b23730c4 |
14 | 2ba982b65c6d |
15 | 14e2ba69b22b |
hex | a75f210dea9 |
11501688643241 has 2 divisors, whose sum is σ = 11501688643242. Its totient is φ = 11501688643240.
The previous prime is 11501688643223. The next prime is 11501688643271. The reversal of 11501688643241 is 14234688610511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9031828090000 + 2469860553241 = 3005300^2 + 1571579^2 .
It is a cyclic number.
It is not a de Polignac number, because 11501688643241 - 210 = 11501688642217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11501688643241.
It is not a weakly prime, because it can be changed into another prime (11501688643271) 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 as a sum of consecutive naturals, namely, 5750844321620 + 5750844321621.
It is an arithmetic number, because the mean of its divisors is an integer number (5750844321621).
Almost surely, 211501688643241 is an apocalyptic number.
It is an amenable number.
11501688643241 is a deficient number, since it is larger than the sum of its proper divisors (1).
11501688643241 is an equidigital number, since it uses as much as digits as its factorization.
11501688643241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1105920, while the sum is 50.
The spelling of 11501688643241 in words is "eleven trillion, five hundred one billion, six hundred eighty-eight million, six hundred forty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •