Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0011101010101110111001 |
3 | 1111010020122000122200110112 |
4 | 2210320330003222232321 |
5 | 2441122124104240043 |
6 | 40033241100554105 |
7 | 2246434666031411 |
oct | 244707403525671 |
9 | 44106560580415 |
10 | 11331131321273 |
11 | 36795622576a5 |
12 | 1330070b52935 |
13 | 6426a0b13c0a |
14 | 2b2603095641 |
15 | 149b36e63518 |
hex | a4e3c0eabb9 |
11331131321273 has 2 divisors, whose sum is σ = 11331131321274. Its totient is φ = 11331131321272.
The previous prime is 11331131321267. The next prime is 11331131321303. The reversal of 11331131321273 is 37212313113311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10842716237584 + 488415083689 = 3292828^2 + 698867^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331131321273 - 28 = 11331131321017 is a prime.
It is not a weakly prime, because it can be changed into another prime (11331131321173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665565660636 + 5665565660637.
It is an arithmetic number, because the mean of its divisors is an integer number (5665565660637).
Almost surely, 211331131321273 is an apocalyptic number.
It is an amenable number.
11331131321273 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331131321273 is an equidigital number, since it uses as much as digits as its factorization.
11331131321273 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6804, while the sum is 32.
Adding to 11331131321273 its reverse (37212313113311), we get a palindrome (48543444434584).
The spelling of 11331131321273 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-one million, three hundred twenty-one thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •