Base | Representation |
---|---|
bin | 10101000100101000… |
… | …11101000001010101 |
3 | 1002012102210101011221 |
4 | 22202110131001111 |
5 | 141132140032313 |
6 | 5110333130341 |
7 | 550231441633 |
oct | 124224350125 |
9 | 32172711157 |
10 | 11313205333 |
11 | 4886011681 |
12 | 22389299b1 |
13 | 10b3a99c51 |
14 | 794720353 |
15 | 46330ac8d |
hex | 2a251d055 |
11313205333 has 2 divisors, whose sum is σ = 11313205334. Its totient is φ = 11313205332.
The previous prime is 11313205331. The next prime is 11313205403. The reversal of 11313205333 is 33350231311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5923149444 + 5390055889 = 76962^2 + 73417^2 .
It is a cyclic number.
It is not a de Polignac number, because 11313205333 - 21 = 11313205331 is a prime.
It is a super-2 number, since 2×113132053332 (a number of 21 digits) contains 22 as substring.
Together with 11313205331, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 11313205298 and 11313205307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11313205331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5656602666 + 5656602667.
It is an arithmetic number, because the mean of its divisors is an integer number (5656602667).
Almost surely, 211313205333 is an apocalyptic number.
It is an amenable number.
11313205333 is a deficient number, since it is larger than the sum of its proper divisors (1).
11313205333 is an equidigital number, since it uses as much as digits as its factorization.
11313205333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2430, while the sum is 25.
Adding to 11313205333 its reverse (33350231311), we get a palindrome (44663436644).
The spelling of 11313205333 in words is "eleven billion, three hundred thirteen million, two hundred five thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •