Base | Representation |
---|---|
bin | 1010010010111110011000… |
… | …1101110101100111100101 |
3 | 1111002021202000020100100211 |
4 | 2210233212031311213211 |
5 | 2440441103402242013 |
6 | 40024501520535421 |
7 | 2245631304354616 |
oct | 244574615654745 |
9 | 44067660210324 |
10 | 11321101212133 |
11 | 36752855481a9 |
12 | 132a131a81571 |
13 | 641762b13bab |
14 | 2b1d30d35c0d |
15 | 14974b60923d |
hex | a4be63759e5 |
11321101212133 has 2 divisors, whose sum is σ = 11321101212134. Its totient is φ = 11321101212132.
The previous prime is 11321101212121. The next prime is 11321101212137. The reversal of 11321101212133 is 33121210112311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10870057338529 + 451043873604 = 3296977^2 + 671598^2 .
It is an emirp because it is prime and its reverse (33121210112311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11321101212133 - 25 = 11321101212101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11321101212137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5660550606066 + 5660550606067.
It is an arithmetic number, because the mean of its divisors is an integer number (5660550606067).
Almost surely, 211321101212133 is an apocalyptic number.
It is an amenable number.
11321101212133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11321101212133 is an equidigital number, since it uses as much as digits as its factorization.
11321101212133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 11321101212133 its reverse (33121210112311), we get a palindrome (44442311324444).
The spelling of 11321101212133 in words is "eleven trillion, three hundred twenty-one billion, one hundred one million, two hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •