Base | Representation |
---|---|
bin | 10100100110000010… |
… | …10111011001010001 |
3 | 1001112112211121002012 |
4 | 22103001113121101 |
5 | 140120433341223 |
6 | 5025044032305 |
7 | 540664032104 |
oct | 122301273121 |
9 | 31475747065 |
10 | 11056543313 |
11 | 4764148702 |
12 | 2186992695 |
13 | 107286412a |
14 | 76c5cc73b |
15 | 44aa0cc78 |
hex | 293057651 |
11056543313 has 2 divisors, whose sum is σ = 11056543314. Its totient is φ = 11056543312.
The previous prime is 11056543261. The next prime is 11056543321. The reversal of 11056543313 is 31334565011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9314566144 + 1741977169 = 96512^2 + 41737^2 .
It is an emirp because it is prime and its reverse (31334565011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11056543313 - 228 = 10788107857 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11056543313.
It is not a weakly prime, because it can be changed into another prime (11056543913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5528271656 + 5528271657.
It is an arithmetic number, because the mean of its divisors is an integer number (5528271657).
Almost surely, 211056543313 is an apocalyptic number.
It is an amenable number.
11056543313 is a deficient number, since it is larger than the sum of its proper divisors (1).
11056543313 is an equidigital number, since it uses as much as digits as its factorization.
11056543313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 32.
The spelling of 11056543313 in words is "eleven billion, fifty-six million, five hundred forty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •