Base | Representation |
---|---|
bin | 1110001001001110000110… |
… | …00100110111001100011111 |
3 | 11002010102121200022221002202 |
4 | 13010213003010313030133 |
5 | 13034043203020201421 |
6 | 150052325305242115 |
7 | 6360061403355131 |
oct | 704470304671437 |
9 | 132112550287082 |
10 | 31103131022111 |
11 | 9a01844672325 |
12 | 35a3bb379333b |
13 | 1448021ab4815 |
14 | 797584605051 |
15 | 38e0e55a010b |
hex | 1c49c313731f |
31103131022111 has 4 divisors (see below), whose sum is σ = 31103145883272. Its totient is φ = 31103116160952.
The previous prime is 31103131022099. The next prime is 31103131022113. The reversal of 31103131022111 is 11122013130113.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 31103131022111 - 226 = 31103063913247 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31103131022113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3650060 + ... + 8690753.
It is an arithmetic number, because the mean of its divisors is an integer number (7775786470818).
Almost surely, 231103131022111 is an apocalyptic number.
31103131022111 is a deficient number, since it is larger than the sum of its proper divisors (14861161).
31103131022111 is a wasteful number, since it uses less digits than its factorization.
31103131022111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14861160.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 31103131022111 its reverse (11122013130113), we get a palindrome (42225144152224).
The spelling of 31103131022111 in words is "thirty-one trillion, one hundred three billion, one hundred thirty-one million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •