Base | Representation |
---|---|
bin | 110100010011001100… |
… | …0011110101111110101 |
3 | 101201220021220200211122 |
4 | 1220212120132233311 |
5 | 3320004123220201 |
6 | 123332415313325 |
7 | 11054136416012 |
oct | 1504630365765 |
9 | 351807820748 |
10 | 112313101301 |
11 | 436a48aa385 |
12 | 1992551b845 |
13 | a78b7ab3bb |
14 | 56164a2709 |
15 | 2dc5205e1b |
hex | 1a2661ebf5 |
112313101301 has 2 divisors, whose sum is σ = 112313101302. Its totient is φ = 112313101300.
The previous prime is 112313101267. The next prime is 112313101319. The reversal of 112313101301 is 103101313211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100711657201 + 11601444100 = 317351^2 + 107710^2 .
It is a cyclic number.
It is not a de Polignac number, because 112313101301 - 26 = 112313101237 is a prime.
It is a super-2 number, since 2×1123131013012 (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 112313101301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112313001301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56156550650 + 56156550651.
It is an arithmetic number, because the mean of its divisors is an integer number (56156550651).
Almost surely, 2112313101301 is an apocalyptic number.
It is an amenable number.
112313101301 is a deficient number, since it is larger than the sum of its proper divisors (1).
112313101301 is an equidigital number, since it uses as much as digits as its factorization.
112313101301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 112313101301 its reverse (103101313211), we get a palindrome (215414414512).
The spelling of 112313101301 in words is "one hundred twelve billion, three hundred thirteen million, one hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •