Base | Representation |
---|---|
bin | 1110001001101111111101… |
… | …11011111111110001101101 |
3 | 11002012011112222001212211202 |
4 | 13010313332323333301231 |
5 | 13034342423142400414 |
6 | 150104533531255245 |
7 | 6361304126336261 |
oct | 704677673776155 |
9 | 132164488055752 |
10 | 31121315200109 |
11 | 9a09526110402 |
12 | 35a76295aa525 |
13 | 144995c21c864 |
14 | 7983cb6960a1 |
15 | 38e80bbd99de |
hex | 1c4dfeeffc6d |
31121315200109 has 2 divisors, whose sum is σ = 31121315200110. Its totient is φ = 31121315200108.
The previous prime is 31121315200049. The next prime is 31121315200111. The reversal of 31121315200109 is 90100251312113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30269220052009 + 852095148100 = 5501747^2 + 923090^2 .
It is a cyclic number.
It is not a de Polignac number, because 31121315200109 - 220 = 31121314151533 is a prime.
It is a super-2 number, since 2×311213152001092 (a number of 28 digits) contains 22 as substring.
Together with 31121315200111, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31121315200009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15560657600054 + 15560657600055.
It is an arithmetic number, because the mean of its divisors is an integer number (15560657600055).
Almost surely, 231121315200109 is an apocalyptic number.
It is an amenable number.
31121315200109 is a deficient number, since it is larger than the sum of its proper divisors (1).
31121315200109 is an equidigital number, since it uses as much as digits as its factorization.
31121315200109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1620, while the sum is 29.
The spelling of 31121315200109 in words is "thirty-one trillion, one hundred twenty-one billion, three hundred fifteen million, two hundred thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •