Base | Representation |
---|---|
bin | 110100010011001000… |
… | …1101010001001111101 |
3 | 101201220011112211210001 |
4 | 1220212101222021331 |
5 | 3320003144004041 |
6 | 123332313114301 |
7 | 11054115260245 |
oct | 1504621521175 |
9 | 351804484701 |
10 | 112311313021 |
11 | 436a3898866 |
12 | 199249b8991 |
13 | a78b30344b |
14 | 5616158b25 |
15 | 2dc4ea1131 |
hex | 1a2646a27d |
112311313021 has 2 divisors, whose sum is σ = 112311313022. Its totient is φ = 112311313020.
The previous prime is 112311312989. The next prime is 112311313027. The reversal of 112311313021 is 120313113211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89603836921 + 22707476100 = 299339^2 + 150690^2 .
It is a cyclic number.
It is not a de Polignac number, because 112311313021 - 25 = 112311312989 is a prime.
It is a super-2 number, since 2×1123113130212 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112311313021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112311313027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56155656510 + 56155656511.
It is an arithmetic number, because the mean of its divisors is an integer number (56155656511).
Almost surely, 2112311313021 is an apocalyptic number.
It is an amenable number.
112311313021 is a deficient number, since it is larger than the sum of its proper divisors (1).
112311313021 is an equidigital number, since it uses as much as digits as its factorization.
112311313021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 112311313021 its reverse (120313113211), we get a palindrome (232624426232).
The spelling of 112311313021 in words is "one hundred twelve billion, three hundred eleven million, three hundred thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •