Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0011101011101011000001 |
3 | 1111010020122000122212202001 |
4 | 2210320330003223223001 |
5 | 2441122124104400441 |
6 | 40033241101024001 |
7 | 2246434666045546 |
oct | 244707403535301 |
9 | 44106560585661 |
10 | 11331131325121 |
11 | 367956225a583 |
12 | 1330070b55001 |
13 | 6426a0b158aa |
14 | 2b2603096bcd |
15 | 149b36e64731 |
hex | a4e3c0ebac1 |
11331131325121 has 2 divisors, whose sum is σ = 11331131325122. Its totient is φ = 11331131325120.
The previous prime is 11331131325109. The next prime is 11331131325179. The reversal of 11331131325121 is 12152313113311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11021311066896 + 309820258225 = 3319836^2 + 556615^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331131325121 - 233 = 11322541390529 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11331131325121.
It is not a weakly prime, because it can be changed into another prime (11331131325191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665565662560 + 5665565662561.
It is an arithmetic number, because the mean of its divisors is an integer number (5665565662561).
Almost surely, 211331131325121 is an apocalyptic number.
It is an amenable number.
11331131325121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331131325121 is an equidigital number, since it uses as much as digits as its factorization.
11331131325121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1620, while the sum is 28.
Adding to 11331131325121 its reverse (12152313113311), we get a palindrome (23483444438432).
The spelling of 11331131325121 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-one million, three hundred twenty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •