Base | Representation |
---|---|
bin | 10101000111000100… |
… | …01010110011011101 |
3 | 1002020212010102011021 |
4 | 22203202022303131 |
5 | 141202343443244 |
6 | 5112341524141 |
7 | 550566552211 |
oct | 124342126335 |
9 | 32225112137 |
10 | 11333577949 |
11 | 4896566951 |
12 | 2243713651 |
13 | 10b8080b55 |
14 | 797304941 |
15 | 464ed2284 |
hex | 2a388acdd |
11333577949 has 2 divisors, whose sum is σ = 11333577950. Its totient is φ = 11333577948.
The previous prime is 11333577877. The next prime is 11333577953. The reversal of 11333577949 is 94977533311.
11333577949 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7044244900 + 4289333049 = 83930^2 + 65493^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11333577949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11333577896 and 11333577905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11333577149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5666788974 + 5666788975.
It is an arithmetic number, because the mean of its divisors is an integer number (5666788975).
Almost surely, 211333577949 is an apocalyptic number.
It is an amenable number.
11333577949 is a deficient number, since it is larger than the sum of its proper divisors (1).
11333577949 is an equidigital number, since it uses as much as digits as its factorization.
11333577949 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2143260, while the sum is 52.
The spelling of 11333577949 in words is "eleven billion, three hundred thirty-three million, five hundred seventy-seven thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •