Base | Representation |
---|---|
bin | 10100100011001010… |
… | …00000001101111011 |
3 | 1001110212021111012201 |
4 | 22101211000031323 |
5 | 140043234044011 |
6 | 5022421051031 |
7 | 540251160463 |
oct | 122145001573 |
9 | 31425244181 |
10 | 11032331131 |
11 | 4751510738 |
12 | 217a856a77 |
13 | 106a8376b3 |
14 | 7692c8ba3 |
15 | 448828cc1 |
hex | 29194037b |
11032331131 has 4 divisors (see below), whose sum is σ = 11032542000. Its totient is φ = 11032120264.
The previous prime is 11032331129. The next prime is 11032331147. The reversal of 11032331131 is 13113323011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13113323011 = 2111 ⋅6211901.
It is a cyclic number.
It is not a de Polignac number, because 11032331131 - 21 = 11032331129 is a prime.
It is a super-2 number, since 2×110323311312 (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 = 11032331099 and 11032331108.
It is not an unprimeable number, because it can be changed into a prime (11032331111) 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, 38970 + ... + 153568.
It is an arithmetic number, because the mean of its divisors is an integer number (2758135500).
Almost surely, 211032331131 is an apocalyptic number.
11032331131 is a deficient number, since it is larger than the sum of its proper divisors (210869).
11032331131 is an equidigital number, since it uses as much as digits as its factorization.
11032331131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210868.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 11032331131 its reverse (13113323011), we get a palindrome (24145654142).
The spelling of 11032331131 in words is "eleven billion, thirty-two million, three hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •