Base | Representation |
---|---|
bin | 1010011110000111001110… |
… | …0000110011001001000001 |
3 | 1111202120122110100202011202 |
4 | 2213201303200303021001 |
5 | 3002104444241044301 |
6 | 40252425140350545 |
7 | 2265514152135461 |
oct | 247416340631101 |
9 | 44676573322152 |
10 | 11512450331201 |
11 | 37394480a0526 |
12 | 135b2343a5455 |
13 | 656808abacc1 |
14 | 2bb2c411dba1 |
15 | 14e6ea36466b |
hex | a7873833241 |
11512450331201 has 2 divisors, whose sum is σ = 11512450331202. Its totient is φ = 11512450331200.
The previous prime is 11512450331159. The next prime is 11512450331219. The reversal of 11512450331201 is 10213305421511.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10218737448976 + 1293712882225 = 3196676^2 + 1137415^2 .
It is a cyclic number.
It is not a de Polignac number, because 11512450331201 - 222 = 11512446136897 is a prime.
It is not a weakly prime, because it can be changed into another prime (11512450231201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5756225165600 + 5756225165601.
It is an arithmetic number, because the mean of its divisors is an integer number (5756225165601).
Almost surely, 211512450331201 is an apocalyptic number.
It is an amenable number.
11512450331201 is a deficient number, since it is larger than the sum of its proper divisors (1).
11512450331201 is an equidigital number, since it uses as much as digits as its factorization.
11512450331201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 11512450331201 its reverse (10213305421511), we get a palindrome (21725755752712).
The spelling of 11512450331201 in words is "eleven trillion, five hundred twelve billion, four hundred fifty million, three hundred thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •