Base | Representation |
---|---|
bin | 10000000000000101100… |
… | …010100000011111000011 |
3 | 10220010021022222022202211 |
4 | 100000011202200133003 |
5 | 121003442231403221 |
6 | 2201052405522551 |
7 | 142305140353462 |
oct | 20000542403703 |
9 | 3803238868684 |
10 | 1099604559811 |
11 | 39438111aa1a |
12 | 15913b413457 |
13 | 7c8ccba22b4 |
14 | 3b314b6c9d9 |
15 | 1d90addd6e1 |
hex | 100058a07c3 |
1099604559811 has 2 divisors, whose sum is σ = 1099604559812. Its totient is φ = 1099604559810.
The previous prime is 1099604559793. The next prime is 1099604559827. The reversal of 1099604559811 is 1189554069901.
It is a strong prime.
It is an emirp because it is prime and its reverse (1189554069901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1099604559811 - 29 = 1099604559299 is a prime.
It is not a weakly prime, because it can be changed into another prime (1099604559871) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 549802279905 + 549802279906.
It is an arithmetic number, because the mean of its divisors is an integer number (549802279906).
Almost surely, 21099604559811 is an apocalyptic number.
1099604559811 is a deficient number, since it is larger than the sum of its proper divisors (1).
1099604559811 is an equidigital number, since it uses as much as digits as its factorization.
1099604559811 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3499200, while the sum is 58.
The spelling of 1099604559811 in words is "one trillion, ninety-nine billion, six hundred four million, five hundred fifty-nine thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •