Base | Representation |
---|---|
bin | 110100010010110101… |
… | …1001111000000010101 |
3 | 101201212110121002122211 |
4 | 1220211223033000111 |
5 | 3314443104142331 |
6 | 123331313153421 |
7 | 11053633535653 |
oct | 1504553170025 |
9 | 351773532584 |
10 | 112301240341 |
11 | 43699139034 |
12 | 1992155b871 |
13 | a7891b7794 |
14 | 5614a95dd3 |
15 | 2dc41618b1 |
hex | 1a25acf015 |
112301240341 has 2 divisors, whose sum is σ = 112301240342. Its totient is φ = 112301240340.
The previous prime is 112301240201. The next prime is 112301240453. The reversal of 112301240341 is 143042103211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 80455053316 + 31846187025 = 283646^2 + 178455^2 .
It is a cyclic number.
It is not a de Polignac number, because 112301240341 - 215 = 112301207573 is a prime.
It is a super-2 number, since 2×1123012403412 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112301240041) 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, 56150620170 + 56150620171.
It is an arithmetic number, because the mean of its divisors is an integer number (56150620171).
Almost surely, 2112301240341 is an apocalyptic number.
It is an amenable number.
112301240341 is a deficient number, since it is larger than the sum of its proper divisors (1).
112301240341 is an equidigital number, since it uses as much as digits as its factorization.
112301240341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 112301240341 its reverse (143042103211), we get a palindrome (255343343552).
The spelling of 112301240341 in words is "one hundred twelve billion, three hundred one million, two hundred forty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •