Base | Representation |
---|---|
bin | 1010010011100000000100… |
… | …0010101111110100111001 |
3 | 1111010011002000121112200101 |
4 | 2210320001002233310321 |
5 | 2441113112123133444 |
6 | 40032554531435401 |
7 | 2246401314244231 |
oct | 244700102576471 |
9 | 44104060545611 |
10 | 11330141224249 |
11 | 36790a43880a1 |
12 | 132ba35455b61 |
13 | 6425739633a3 |
14 | 2b254b7a4cc1 |
15 | 149aca08b3d4 |
hex | a4e010afd39 |
11330141224249 has 2 divisors, whose sum is σ = 11330141224250. Its totient is φ = 11330141224248.
The previous prime is 11330141224169. The next prime is 11330141224261. The reversal of 11330141224249 is 94242214103311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7487337690000 + 3842803534249 = 2736300^2 + 1960307^2 .
It is an emirp because it is prime and its reverse (94242214103311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11330141224249 - 213 = 11330141216057 is a prime.
It is a super-2 number, since 2×113301412242492 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11330141234249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665070612124 + 5665070612125.
It is an arithmetic number, because the mean of its divisors is an integer number (5665070612125).
Almost surely, 211330141224249 is an apocalyptic number.
It is an amenable number.
11330141224249 is a deficient number, since it is larger than the sum of its proper divisors (1).
11330141224249 is an equidigital number, since it uses as much as digits as its factorization.
11330141224249 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 41472, while the sum is 37.
The spelling of 11330141224249 in words is "eleven trillion, three hundred thirty billion, one hundred forty-one million, two hundred twenty-four thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •