Base | Representation |
---|---|
bin | 11001110000111001001101… |
… | …001111001100011111011111 |
3 | 112212012102210222200122202121 |
4 | 121300321031033030133133 |
5 | 104322442134444011111 |
6 | 1040554224501403411 |
7 | 32603313155102161 |
oct | 3160711517143737 |
9 | 485172728618677 |
10 | 113311123032031 |
11 | 33116a82a33821 |
12 | 10860555a09567 |
13 | 4b2c2681a3602 |
14 | 1dda405314931 |
15 | d17737da8871 |
hex | 670e4d3cc7df |
113311123032031 has 2 divisors, whose sum is σ = 113311123032032. Its totient is φ = 113311123032030.
The previous prime is 113311123031989. The next prime is 113311123032049. The reversal of 113311123032031 is 130230321113311.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 113311123032031 - 223 = 113311114643423 is a prime.
It is a super-2 number, since 2×1133111230320312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113311123031987 and 113311123032005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113311123032091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56655561516015 + 56655561516016.
It is an arithmetic number, because the mean of its divisors is an integer number (56655561516016).
Almost surely, 2113311123032031 is an apocalyptic number.
113311123032031 is a deficient number, since it is larger than the sum of its proper divisors (1).
113311123032031 is an equidigital number, since it uses as much as digits as its factorization.
113311123032031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 113311123032031 its reverse (130230321113311), we get a palindrome (243541444145342).
The spelling of 113311123032031 in words is "one hundred thirteen trillion, three hundred eleven billion, one hundred twenty-three million, thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •