Base | Representation |
---|---|
bin | 11001100010100000001000… |
… | …110110110110011001110011 |
3 | 112201200220001121001212210011 |
4 | 121202200020312312121303 |
5 | 104210241212112240311 |
6 | 1034520024203515351 |
7 | 32442002113212013 |
oct | 3142401066663163 |
9 | 481626047055704 |
10 | 112322133321331 |
11 | 3287560503417a |
12 | 10720947228b57 |
13 | 4a89c15cc586b |
14 | 1da45c5299c43 |
15 | cebb53065321 |
hex | 662808db6673 |
112322133321331 has 2 divisors, whose sum is σ = 112322133321332. Its totient is φ = 112322133321330.
The previous prime is 112322133321317. The next prime is 112322133321367. The reversal of 112322133321331 is 133123331223211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 112322133321331 - 223 = 112322124932723 is a prime.
It is a super-2 number, since 2×1123221333213312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112322133321293 and 112322133321302.
It is not a weakly prime, because it can be changed into another prime (112322133328331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56161066660665 + 56161066660666.
It is an arithmetic number, because the mean of its divisors is an integer number (56161066660666).
Almost surely, 2112322133321331 is an apocalyptic number.
112322133321331 is a deficient number, since it is larger than the sum of its proper divisors (1).
112322133321331 is an equidigital number, since it uses as much as digits as its factorization.
112322133321331 is an evil number, because the sum of its binary digits is even.
The product of its digits is 11664, while the sum is 31.
Adding to 112322133321331 its reverse (133123331223211), we get a palindrome (245445464544542).
The spelling of 112322133321331 in words is "one hundred twelve trillion, three hundred twenty-two billion, one hundred thirty-three million, three hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •