Base | Representation |
---|---|
bin | 10101101011110010… |
… | …01100010010111101 |
3 | 1010001022201201110011 |
4 | 22311321030102331 |
5 | 142320222301021 |
6 | 5203103543221 |
7 | 561326665201 |
oct | 126571142275 |
9 | 33038651404 |
10 | 11641603261 |
11 | 4a34421922 |
12 | 230a8bab11 |
13 | 1136b2b752 |
14 | 7c61a6b01 |
15 | 482078de1 |
hex | 2b5e4c4bd |
11641603261 has 2 divisors, whose sum is σ = 11641603262. Its totient is φ = 11641603260.
The previous prime is 11641603229. The next prime is 11641603279. The reversal of 11641603261 is 16230614611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7483288036 + 4158315225 = 86506^2 + 64485^2 .
It is a cyclic number.
It is not a de Polignac number, because 11641603261 - 25 = 11641603229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11641603861) 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 as a sum of consecutive naturals, namely, 5820801630 + 5820801631.
It is an arithmetic number, because the mean of its divisors is an integer number (5820801631).
Almost surely, 211641603261 is an apocalyptic number.
It is an amenable number.
11641603261 is a deficient number, since it is larger than the sum of its proper divisors (1).
11641603261 is an equidigital number, since it uses as much as digits as its factorization.
11641603261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 31.
The spelling of 11641603261 in words is "eleven billion, six hundred forty-one million, six hundred three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •