Base | Representation |
---|---|
bin | 10101000100011000… |
… | …01010100000001011 |
3 | 1002012021200222101101 |
4 | 22202030022200023 |
5 | 141131111013311 |
6 | 5110214402231 |
7 | 550204121434 |
oct | 124214124013 |
9 | 32167628341 |
10 | 11311032331 |
11 | 4884868005 |
12 | 2238060377 |
13 | 10b34b8b51 |
14 | 79431648b |
15 | 46302bec1 |
hex | 2a230a80b |
11311032331 has 4 divisors (see below), whose sum is σ = 11976387192. Its totient is φ = 10645677472.
The previous prime is 11311032289. The next prime is 11311032347. The reversal of 11311032331 is 13323011311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13323011311 = 599 ⋅22242089.
It is a cyclic number.
It is not a de Polignac number, because 11311032331 - 27 = 11311032203 is a prime.
It is a super-2 number, since 2×113110323312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11311032299 and 11311032308.
It is not an unprimeable number, because it can be changed into a prime (11311032731) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 332677405 + ... + 332677438.
It is an arithmetic number, because the mean of its divisors is an integer number (2994096798).
Almost surely, 211311032331 is an apocalyptic number.
11311032331 is a deficient number, since it is larger than the sum of its proper divisors (665354861).
11311032331 is an equidigital number, since it uses as much as digits as its factorization.
11311032331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 665354860.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 11311032331 its reverse (13323011311), we get a palindrome (24634043642).
The spelling of 11311032331 in words is "eleven billion, three hundred eleven million, thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •