Base | Representation |
---|---|
bin | 10000011111010010110… |
… | …011011111101000101011 |
3 | 11000022202121020012111012 |
4 | 100133102303133220223 |
5 | 122031103424110011 |
6 | 2224313414254135 |
7 | 144602412354656 |
oct | 20372263375053 |
9 | 4008677205435 |
10 | 1133113113131 |
11 | 3a76068a2a9a |
12 | 16373135734b |
13 | 82b10109c3c |
14 | 3cbb316089d |
15 | 1e71ca63a8b |
hex | 107d2cdfa2b |
1133113113131 has 2 divisors, whose sum is σ = 1133113113132. Its totient is φ = 1133113113130.
The previous prime is 1133113113103. The next prime is 1133113113137. The reversal of 1133113113131 is 1313113113311.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1133113113131 - 210 = 1133113112107 is a prime.
It is a super-2 number, since 2×11331131131312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1133113113097 and 1133113113106.
It is not a weakly prime, because it can be changed into another prime (1133113113137) 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 as a sum of consecutive naturals, namely, 566556556565 + 566556556566.
It is an arithmetic number, because the mean of its divisors is an integer number (566556556566).
Almost surely, 21133113113131 is an apocalyptic number.
1133113113131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1133113113131 is an equidigital number, since it uses as much as digits as its factorization.
1133113113131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 243, while the sum is 23.
Adding to 1133113113131 its reverse (1313113113311), we get a palindrome (2446226226442).
The spelling of 1133113113131 in words is "one trillion, one hundred thirty-three billion, one hundred thirteen million, one hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •