Base | Representation |
---|---|
bin | 110100010011000111… |
… | …0010000111111001101 |
3 | 101201220002212122120212 |
4 | 1220212032100333031 |
5 | 3320002432023001 |
6 | 123332242052205 |
7 | 11054104564013 |
oct | 1504616207715 |
9 | 351802778525 |
10 | 112310423501 |
11 | 436a3340521 |
12 | 1992464a065 |
13 | a78b0815c3 |
14 | 5615da68b3 |
15 | 2dc4d777bb |
hex | 1a26390fcd |
112310423501 has 2 divisors, whose sum is σ = 112310423502. Its totient is φ = 112310423500.
The previous prime is 112310423473. The next prime is 112310423509. The reversal of 112310423501 is 105324013211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 74654632900 + 37655790601 = 273230^2 + 194051^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112310423501 is a prime.
It is a super-2 number, since 2×1123104235012 (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 (112310423509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56155211750 + 56155211751.
It is an arithmetic number, because the mean of its divisors is an integer number (56155211751).
Almost surely, 2112310423501 is an apocalyptic number.
It is an amenable number.
112310423501 is a deficient number, since it is larger than the sum of its proper divisors (1).
112310423501 is an equidigital number, since it uses as much as digits as its factorization.
112310423501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 112310423501 its reverse (105324013211), we get a palindrome (217634436712).
The spelling of 112310423501 in words is "one hundred twelve billion, three hundred ten million, four hundred twenty-three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •