Base | Representation |
---|---|
bin | 10101000111000000… |
… | …10110111011010101 |
3 | 1002020211020022002022 |
4 | 22203200112323111 |
5 | 141202233301232 |
6 | 5112323422525 |
7 | 550562534354 |
oct | 124340267325 |
9 | 32224208068 |
10 | 11333103317 |
11 | 4896272298 |
12 | 2243524a45 |
13 | 10b7c45ac3 |
14 | 79721d99b |
15 | 464e3b812 |
hex | 2a3816ed5 |
11333103317 has 2 divisors, whose sum is σ = 11333103318. Its totient is φ = 11333103316.
The previous prime is 11333103281. The next prime is 11333103359. The reversal of 11333103317 is 71330133311.
11333103317 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., 10852222276 + 480881041 = 104174^2 + 21929^2 .
It is a cyclic number.
It is not a de Polignac number, because 11333103317 - 210 = 11333102293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11333103017) 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, 5666551658 + 5666551659.
It is an arithmetic number, because the mean of its divisors is an integer number (5666551659).
Almost surely, 211333103317 is an apocalyptic number.
It is an amenable number.
11333103317 is a deficient number, since it is larger than the sum of its proper divisors (1).
11333103317 is an equidigital number, since it uses as much as digits as its factorization.
11333103317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1701, while the sum is 26.
Adding to 11333103317 its reverse (71330133311), we get a palindrome (82663236628).
The spelling of 11333103317 in words is "eleven billion, three hundred thirty-three million, one hundred three thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •