Base | Representation |
---|---|
bin | 11001100010010110111000… |
… | …111110100010000010111101 |
3 | 112201122221102112211122000222 |
4 | 121202112320332202002331 |
5 | 104210110343011120404 |
6 | 1034511302555231125 |
7 | 32441201044604462 |
oct | 3142267076420275 |
9 | 481587375748028 |
10 | 112312203223229 |
11 | 32871379823529 |
12 | 1071aa357484a5 |
13 | 4a88cc2941379 |
14 | 1da3d22531669 |
15 | ceb7713b3dbe |
hex | 6625b8fa20bd |
112312203223229 has 2 divisors, whose sum is σ = 112312203223230. Its totient is φ = 112312203223228.
The previous prime is 112312203223177. The next prime is 112312203223279. The reversal of 112312203223229 is 922322302213211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 63425327856004 + 48886875367225 = 7964002^2 + 6991915^2 .
It is a cyclic number.
It is not a de Polignac number, because 112312203223229 - 212 = 112312203219133 is a prime.
It is a super-2 number, since 2×1123122032232292 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112312203223279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56156101611614 + 56156101611615.
It is an arithmetic number, because the mean of its divisors is an integer number (56156101611615).
Almost surely, 2112312203223229 is an apocalyptic number.
It is an amenable number.
112312203223229 is a deficient number, since it is larger than the sum of its proper divisors (1).
112312203223229 is an equidigital number, since it uses as much as digits as its factorization.
112312203223229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 31104, while the sum is 35.
The spelling of 112312203223229 in words is "one hundred twelve trillion, three hundred twelve billion, two hundred three million, two hundred twenty-three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •