Base | Representation |
---|---|
bin | 10100100110101000… |
… | …10010110111101001 |
3 | 1001112220011200221101 |
4 | 22103110102313221 |
5 | 140123221134023 |
6 | 5025342241401 |
7 | 541054150132 |
oct | 122324226751 |
9 | 31486150841 |
10 | 11061505513 |
11 | 4766a278a3 |
12 | 2188586261 |
13 | 10738b0946 |
14 | 76d120c89 |
15 | 44b18d1ad |
hex | 293512de9 |
11061505513 has 2 divisors, whose sum is σ = 11061505514. Its totient is φ = 11061505512.
The previous prime is 11061505501. The next prime is 11061505523. The reversal of 11061505513 is 31550516011.
11061505513 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., 10545852249 + 515653264 = 102693^2 + 22708^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11061505513 is a prime.
It is not a weakly prime, because it can be changed into another prime (11061505523) 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, 5530752756 + 5530752757.
It is an arithmetic number, because the mean of its divisors is an integer number (5530752757).
Almost surely, 211061505513 is an apocalyptic number.
It is an amenable number.
11061505513 is a deficient number, since it is larger than the sum of its proper divisors (1).
11061505513 is an equidigital number, since it uses as much as digits as its factorization.
11061505513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2250, while the sum is 28.
The spelling of 11061505513 in words is "eleven billion, sixty-one million, five hundred five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •