Base | Representation |
---|---|
bin | 10101101011110010… |
… | …01100001111010011 |
3 | 1010001022201201010111 |
4 | 22311321030033103 |
5 | 142320222244102 |
6 | 5203103542151 |
7 | 561326664415 |
oct | 126571141723 |
9 | 33038651114 |
10 | 11641603027 |
11 | 4a3442172a |
12 | 230a8ba957 |
13 | 1136b2b602 |
14 | 7c61a69b5 |
15 | 482078cd7 |
hex | 2b5e4c3d3 |
11641603027 has 2 divisors, whose sum is σ = 11641603028. Its totient is φ = 11641603026.
The previous prime is 11641602997. The next prime is 11641603049. The reversal of 11641603027 is 72030614611.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11641603027 - 223 = 11633214419 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11641603027.
It is not a weakly prime, because it can be changed into another prime (11641606027) 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, 5820801513 + 5820801514.
It is an arithmetic number, because the mean of its divisors is an integer number (5820801514).
Almost surely, 211641603027 is an apocalyptic number.
11641603027 is a deficient number, since it is larger than the sum of its proper divisors (1).
11641603027 is an equidigital number, since it uses as much as digits as its factorization.
11641603027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 31.
The spelling of 11641603027 in words is "eleven billion, six hundred forty-one million, six hundred three thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •