Base | Representation |
---|---|
bin | 10101100111100011… |
… | …00111001010010001 |
3 | 1002221211212000121112 |
4 | 22303301213022101 |
5 | 142232122433323 |
6 | 5155354103105 |
7 | 560415616421 |
oct | 126361471221 |
9 | 32854760545 |
10 | 11606061713 |
11 | 4a16356a44 |
12 | 22baa1aa95 |
13 | 112c66634c |
14 | 7c1594481 |
15 | 47dda8178 |
hex | 2b3c67291 |
11606061713 has 2 divisors, whose sum is σ = 11606061714. Its totient is φ = 11606061712.
The previous prime is 11606061689. The next prime is 11606061767. The reversal of 11606061713 is 31716060611.
11606061713 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11507496529 + 98565184 = 107273^2 + 9928^2 .
It is a cyclic number.
It is not a de Polignac number, because 11606061713 - 28 = 11606061457 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11606061713.
It is not a weakly prime, because it can be changed into another prime (11606061113) 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, 5803030856 + 5803030857.
It is an arithmetic number, because the mean of its divisors is an integer number (5803030857).
Almost surely, 211606061713 is an apocalyptic number.
It is an amenable number.
11606061713 is a deficient number, since it is larger than the sum of its proper divisors (1).
11606061713 is an equidigital number, since it uses as much as digits as its factorization.
11606061713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 32.
The spelling of 11606061713 in words is "eleven billion, six hundred six million, sixty-one thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •