Base | Representation |
---|---|
bin | 1010010010111110011011… |
… | …0111000100110100000001 |
3 | 1111002021202202120120002101 |
4 | 2210233212313010310001 |
5 | 2440441114134203043 |
6 | 40024502544350401 |
7 | 2245631465300224 |
oct | 244574667046401 |
9 | 44067682516071 |
10 | 11321112022273 |
11 | 3675290660aa9 |
12 | 132a135615401 |
13 | 64176512a421 |
14 | 2b1d3254b5bb |
15 | 14974c54224d |
hex | a4be6dc4d01 |
11321112022273 has 2 divisors, whose sum is σ = 11321112022274. Its totient is φ = 11321112022272.
The previous prime is 11321112022261. The next prime is 11321112022327. The reversal of 11321112022273 is 37222021112311.
Together with next prime (11321112022327) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11271919887424 + 49192134849 = 3357368^2 + 221793^2 .
It is a cyclic number.
It is not a de Polignac number, because 11321112022273 - 237 = 11183673068801 is a prime.
It is not a weakly prime, because it can be changed into another prime (11321112022223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5660556011136 + 5660556011137.
It is an arithmetic number, because the mean of its divisors is an integer number (5660556011137).
Almost surely, 211321112022273 is an apocalyptic number.
It is an amenable number.
11321112022273 is a deficient number, since it is larger than the sum of its proper divisors (1).
11321112022273 is an equidigital number, since it uses as much as digits as its factorization.
11321112022273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 28.
Adding to 11321112022273 its reverse (37222021112311), we get a palindrome (48543133134584).
The spelling of 11321112022273 in words is "eleven trillion, three hundred twenty-one billion, one hundred twelve million, twenty-two thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •