Base | Representation |
---|---|
bin | 1010010010111110110101… |
… | …1010101001100010011101 |
3 | 1111002022001102112120022022 |
4 | 2210233231122221202131 |
5 | 2440441330313323122 |
6 | 40024521514025525 |
7 | 2245634302214201 |
oct | 244575532514235 |
9 | 44068042476268 |
10 | 11321222011037 |
11 | 3675337755204 |
12 | 132a1664182a5 |
13 | 641781b5a633 |
14 | 2b1d42dbcb01 |
15 | 14975701b642 |
hex | a4bed6a989d |
11321222011037 has 2 divisors, whose sum is σ = 11321222011038. Its totient is φ = 11321222011036.
The previous prime is 11321222010941. The next prime is 11321222011049. The reversal of 11321222011037 is 73011022212311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10701756993316 + 619465017721 = 3271354^2 + 787061^2 .
It is a cyclic number.
It is not a de Polignac number, because 11321222011037 - 214 = 11321221994653 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11321222010997 and 11321222011015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11321222011237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5660611005518 + 5660611005519.
It is an arithmetic number, because the mean of its divisors is an integer number (5660611005519).
Almost surely, 211321222011037 is an apocalyptic number.
It is an amenable number.
11321222011037 is a deficient number, since it is larger than the sum of its proper divisors (1).
11321222011037 is an equidigital number, since it uses as much as digits as its factorization.
11321222011037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1008, while the sum is 26.
Adding to 11321222011037 its reverse (73011022212311), we get a palindrome (84332244223348).
The spelling of 11321222011037 in words is "eleven trillion, three hundred twenty-one billion, two hundred twenty-two million, eleven thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •