Base | Representation |
---|---|
bin | 10101100011100111… |
… | …11001000100011111 |
3 | 1002212112211122101211 |
4 | 22301303321010133 |
5 | 142200203324202 |
6 | 5152215445251 |
7 | 556535524456 |
oct | 126163710437 |
9 | 32775748354 |
10 | 11573104927 |
11 | 49a979702a |
12 | 22ab986827 |
13 | 11258975a7 |
14 | 7bb055b9d |
15 | 47b0481d7 |
hex | 2b1cf911f |
11573104927 has 2 divisors, whose sum is σ = 11573104928. Its totient is φ = 11573104926.
The previous prime is 11573104883. The next prime is 11573104937. The reversal of 11573104927 is 72940137511.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (72940137511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11573104927 - 219 = 11572580639 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11573104927.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11573104937) 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, 5786552463 + 5786552464.
It is an arithmetic number, because the mean of its divisors is an integer number (5786552464).
Almost surely, 211573104927 is an apocalyptic number.
11573104927 is a deficient number, since it is larger than the sum of its proper divisors (1).
11573104927 is an equidigital number, since it uses as much as digits as its factorization.
11573104927 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52920, while the sum is 40.
The spelling of 11573104927 in words is "eleven billion, five hundred seventy-three million, one hundred four thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •