Base | Representation |
---|---|
bin | 10100111111000110… |
… | …00101011001110011 |
3 | 1002002012022010100111 |
4 | 22133203011121303 |
5 | 141033234142412 |
6 | 5101552402151 |
7 | 546125306263 |
oct | 123743053163 |
9 | 32065263314 |
10 | 11266709107 |
11 | 4861844345 |
12 | 2225246357 |
13 | 10a726a5a4 |
14 | 78c4997a3 |
15 | 45e1c42a7 |
hex | 29f8c5673 |
11266709107 has 2 divisors, whose sum is σ = 11266709108. Its totient is φ = 11266709106.
The previous prime is 11266709071. The next prime is 11266709117. The reversal of 11266709107 is 70190766211.
Together with previous prime (11266709071) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11266709107 - 211 = 11266707059 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11266709107.
It is not a weakly prime, because it can be changed into another prime (11266709117) 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, 5633354553 + 5633354554.
It is an arithmetic number, because the mean of its divisors is an integer number (5633354554).
Almost surely, 211266709107 is an apocalyptic number.
11266709107 is a deficient number, since it is larger than the sum of its proper divisors (1).
11266709107 is an equidigital number, since it uses as much as digits as its factorization.
11266709107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31752, while the sum is 40.
The spelling of 11266709107 in words is "eleven billion, two hundred sixty-six million, seven hundred nine thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •