Base | Representation |
---|---|
bin | 110100001010001100… |
… | …1001111010001110001 |
3 | 101201010021001010021012 |
4 | 1220110121033101301 |
5 | 3313344343411233 |
6 | 123242435040305 |
7 | 11043513266366 |
oct | 1502431172161 |
9 | 351107033235 |
10 | 112011310193 |
11 | 4355a512242 |
12 | 19860440095 |
13 | a741104293 |
14 | 55c838446d |
15 | 2da8991548 |
hex | 1a1464f471 |
112011310193 has 2 divisors, whose sum is σ = 112011310194. Its totient is φ = 112011310192.
The previous prime is 112011310153. The next prime is 112011310259. The reversal of 112011310193 is 391013110211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90716620864 + 21294689329 = 301192^2 + 145927^2 .
It is an emirp because it is prime and its reverse (391013110211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112011310193 - 212 = 112011306097 is a prime.
It is a super-2 number, since 2×1120113101932 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112011310153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56005655096 + 56005655097.
It is an arithmetic number, because the mean of its divisors is an integer number (56005655097).
Almost surely, 2112011310193 is an apocalyptic number.
It is an amenable number.
112011310193 is a deficient number, since it is larger than the sum of its proper divisors (1).
112011310193 is an equidigital number, since it uses as much as digits as its factorization.
112011310193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 23.
The spelling of 112011310193 in words is "one hundred twelve billion, eleven million, three hundred ten thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •