Base | Representation |
---|---|
bin | 1010011101111011000111… |
… | …0101111011000110110011 |
3 | 1111202021021000100010202001 |
4 | 2213132301311323012303 |
5 | 3002031320434321242 |
6 | 40251130510034431 |
7 | 2265340506055132 |
oct | 247366165730663 |
9 | 44667230303661 |
10 | 11509201088947 |
11 | 373802aa74751 |
12 | 135a6881a8a17 |
13 | 65640b89ac53 |
14 | 2bb096797919 |
15 | 14e5a9e8aeb7 |
hex | a77b1d7b1b3 |
11509201088947 has 2 divisors, whose sum is σ = 11509201088948. Its totient is φ = 11509201088946.
The previous prime is 11509201088933. The next prime is 11509201088953. The reversal of 11509201088947 is 74988010290511.
It is a strong prime.
It is an emirp because it is prime and its reverse (74988010290511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11509201088947 - 215 = 11509201056179 is a prime.
It is not a weakly prime, because it can be changed into another prime (11509201086947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5754600544473 + 5754600544474.
It is an arithmetic number, because the mean of its divisors is an integer number (5754600544474).
Almost surely, 211509201088947 is an apocalyptic number.
11509201088947 is a deficient number, since it is larger than the sum of its proper divisors (1).
11509201088947 is an equidigital number, since it uses as much as digits as its factorization.
11509201088947 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1451520, while the sum is 55.
The spelling of 11509201088947 in words is "eleven trillion, five hundred nine billion, two hundred one million, eighty-eight thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •