Base | Representation |
---|---|
bin | 1010010011100111011010… |
… | …0001110011110100101001 |
3 | 1111010100011101112122011002 |
4 | 2210321312201303310221 |
5 | 2441131131222120403 |
6 | 40033522302444345 |
7 | 2246501210154554 |
oct | 244716641636451 |
9 | 44110141478132 |
10 | 11332112301353 |
11 | 3679a15a6a538 |
12 | 13302a55936b5 |
13 | 6427c9121abc |
14 | 2b269749169b |
15 | 149b93139188 |
hex | a4e76873d29 |
11332112301353 has 2 divisors, whose sum is σ = 11332112301354. Its totient is φ = 11332112301352.
The previous prime is 11332112301277. The next prime is 11332112301421. The reversal of 11332112301353 is 35310321123311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11290621463104 + 41490838249 = 3360152^2 + 203693^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11332112301353 is a prime.
It is not a weakly prime, because it can be changed into another prime (11332112303353) 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, 5666056150676 + 5666056150677.
It is an arithmetic number, because the mean of its divisors is an integer number (5666056150677).
Almost surely, 211332112301353 is an apocalyptic number.
It is an amenable number.
11332112301353 is a deficient number, since it is larger than the sum of its proper divisors (1).
11332112301353 is an equidigital number, since it uses as much as digits as its factorization.
11332112301353 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.
Adding to 11332112301353 its reverse (35310321123311), we get a palindrome (46642433424664).
The spelling of 11332112301353 in words is "eleven trillion, three hundred thirty-two billion, one hundred twelve million, three hundred one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •