Base | Representation |
---|---|
bin | 10101100000000111… |
… | …00111000001001001 |
3 | 1002210111110020110002 |
4 | 22300003213001021 |
5 | 142120134431412 |
6 | 5145244532345 |
7 | 556030404035 |
oct | 126003470111 |
9 | 32714406402 |
10 | 11543670857 |
11 | 4994112854 |
12 | 22a1b510b5 |
13 | 111c760094 |
14 | 7b71931c5 |
15 | 478681dc2 |
hex | 2b00e7049 |
11543670857 has 2 divisors, whose sum is σ = 11543670858. Its totient is φ = 11543670856.
The previous prime is 11543670773. The next prime is 11543670869. The reversal of 11543670857 is 75807634511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7459949641 + 4083721216 = 86371^2 + 63904^2 .
It is a cyclic number.
It is not a de Polignac number, because 11543670857 - 224 = 11526893641 is a prime.
It is a super-2 number, since 2×115436708572 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11543670557) 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, 5771835428 + 5771835429.
It is an arithmetic number, because the mean of its divisors is an integer number (5771835429).
Almost surely, 211543670857 is an apocalyptic number.
It is an amenable number.
11543670857 is a deficient number, since it is larger than the sum of its proper divisors (1).
11543670857 is an equidigital number, since it uses as much as digits as its factorization.
11543670857 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 705600, while the sum is 47.
The spelling of 11543670857 in words is "eleven billion, five hundred forty-three million, six hundred seventy thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •