Base | Representation |
---|---|
bin | 10100100011011110… |
… | …11011111111011011 |
3 | 1001111001102110012102 |
4 | 22101233123333123 |
5 | 140044434110311 |
6 | 5022555434015 |
7 | 540313342022 |
oct | 122157337733 |
9 | 31431373172 |
10 | 11035066331 |
11 | 4753009733 |
12 | 217b75590b |
13 | 106b284663 |
14 | 7697db8b9 |
15 | 448bb943b |
hex | 291bdbfdb |
11035066331 has 2 divisors, whose sum is σ = 11035066332. Its totient is φ = 11035066330.
The previous prime is 11035066313. The next prime is 11035066351. The reversal of 11035066331 is 13366053011.
Together with previous prime (11035066313) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (13366053011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11035066331 is a prime.
It is a super-2 number, since 2×110350663312 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 11035066294 and 11035066303.
It is not a weakly prime, because it can be changed into another prime (11035066351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5517533165 + 5517533166.
It is an arithmetic number, because the mean of its divisors is an integer number (5517533166).
Almost surely, 211035066331 is an apocalyptic number.
11035066331 is a deficient number, since it is larger than the sum of its proper divisors (1).
11035066331 is an equidigital number, since it uses as much as digits as its factorization.
11035066331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 29.
The spelling of 11035066331 in words is "eleven billion, thirty-five million, sixty-six thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •