Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0011101101001011010001 |
3 | 1111010020122000200012012012 |
4 | 2210320330003231023101 |
5 | 2441122124110100111 |
6 | 40033241101112305 |
7 | 2246434666102526 |
oct | 244707403551321 |
9 | 44106560605165 |
10 | 11331131331281 |
11 | 3679562264173 |
12 | 1330070b58695 |
13 | 6426a0b18638 |
14 | 2b260309914d |
15 | 149b36e6648b |
hex | a4e3c0ed2d1 |
11331131331281 has 2 divisors, whose sum is σ = 11331131331282. Its totient is φ = 11331131331280.
The previous prime is 11331131331259. The next prime is 11331131331323. The reversal of 11331131331281 is 18213313113311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10863253443025 + 467877888256 = 3295945^2 + 684016^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331131331281 - 26 = 11331131331217 is a prime.
It is a super-2 number, since 2×113311313312812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11331131336281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665565665640 + 5665565665641.
It is an arithmetic number, because the mean of its divisors is an integer number (5665565665641).
Almost surely, 211331131331281 is an apocalyptic number.
It is an amenable number.
11331131331281 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331131331281 is an equidigital number, since it uses as much as digits as its factorization.
11331131331281 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3888, while the sum is 32.
Adding to 11331131331281 its reverse (18213313113311), we get a palindrome (29544444444592).
The spelling of 11331131331281 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-one million, three hundred thirty-one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •