Base | Representation |
---|---|
bin | 111101011101011… |
… | …000010110110001 |
3 | 2122212012220220112 |
4 | 331131120112301 |
5 | 4102431041423 |
6 | 250152151105 |
7 | 34360210523 |
oct | 7535302661 |
9 | 2585186815 |
10 | 1031112113 |
11 | 48a043879 |
12 | 249398495 |
13 | 135811415 |
14 | 9ad29a13 |
15 | 607c9a78 |
hex | 3d7585b1 |
1031112113 has 2 divisors, whose sum is σ = 1031112114. Its totient is φ = 1031112112.
The previous prime is 1031112109. The next prime is 1031112127. The reversal of 1031112113 is 3112111301.
It is a happy number.
It is an a-pointer prime, because the next prime (1031112127) can be obtained adding 1031112113 to its sum of digits (14).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 773284864 + 257827249 = 27808^2 + 16057^2 .
It is a cyclic number.
It is not a de Polignac number, because 1031112113 - 22 = 1031112109 is a prime.
It is not a weakly prime, because it can be changed into another prime (1031112193) 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, 515556056 + 515556057.
It is an arithmetic number, because the mean of its divisors is an integer number (515556057).
Almost surely, 21031112113 is an apocalyptic number.
It is an amenable number.
1031112113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031112113 is an equidigital number, since it uses as much as digits as its factorization.
1031112113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 14.
The square root of 1031112113 is about 32110.9344772151. The cubic root of 1031112113 is about 1010.2649741010.
Adding to 1031112113 its reverse (3112111301), we get a palindrome (4143223414).
The spelling of 1031112113 in words is "one billion, thirty-one million, one hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •