Base | Representation |
---|---|
bin | 1010010010010101001001… |
… | …1000011100111101000101 |
3 | 1111001020011111201221021011 |
4 | 2210211102120130331011 |
5 | 2440300420421012013 |
6 | 40015431224322221 |
7 | 2245060053365431 |
oct | 244452230347505 |
9 | 44036144657234 |
10 | 11310031032133 |
11 | 3670614736109 |
12 | 1327b62613371 |
13 | 6406ba4b6b22 |
14 | 2b15a09d79c1 |
15 | 1492ee805c3d |
hex | a495261cf45 |
11310031032133 has 2 divisors, whose sum is σ = 11310031032134. Its totient is φ = 11310031032132.
The previous prime is 11310031032127. The next prime is 11310031032149. The reversal of 11310031032133 is 33123013001311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7913407834084 + 3396623198049 = 2813078^2 + 1842993^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11310031032133 is a prime.
It is a super-2 number, since 2×113100310321332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11310038032133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5655015516066 + 5655015516067.
It is an arithmetic number, because the mean of its divisors is an integer number (5655015516067).
Almost surely, 211310031032133 is an apocalyptic number.
It is an amenable number.
11310031032133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11310031032133 is an equidigital number, since it uses as much as digits as its factorization.
11310031032133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 11310031032133 its reverse (33123013001311), we get a palindrome (44433044033444).
The spelling of 11310031032133 in words is "eleven trillion, three hundred ten billion, thirty-one million, thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •