Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0010111100100110001111 |
3 | 1111010020122000022002020122 |
4 | 2210320330002330212033 |
5 | 2441122124032213203 |
6 | 40033241052535155 |
7 | 2246434664313443 |
oct | 244707402744617 |
9 | 44106560262218 |
10 | 11331131132303 |
11 | 3679562138724 |
12 | 1330070a814bb |
13 | 6426a0a78bb8 |
14 | 2b2603046823 |
15 | 149b36e27538 |
hex | a4e3c0bc98f |
11331131132303 has 2 divisors, whose sum is σ = 11331131132304. Its totient is φ = 11331131132302.
The previous prime is 11331131132281. The next prime is 11331131132353. The reversal of 11331131132303 is 30323113113311.
11331131132303 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (30323113113311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11331131132303 - 28 = 11331131132047 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11331131132353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665565566151 + 5665565566152.
It is an arithmetic number, because the mean of its divisors is an integer number (5665565566152).
Almost surely, 211331131132303 is an apocalyptic number.
11331131132303 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331131132303 is an equidigital number, since it uses as much as digits as its factorization.
11331131132303 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 26.
Adding to 11331131132303 its reverse (30323113113311), we get a palindrome (41654244245614).
The spelling of 11331131132303 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-one million, one hundred thirty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •