Base | Representation |
---|---|
bin | 1010001100001010010000… |
… | …1111001011001010110001 |
3 | 1110200002120010101011022121 |
4 | 2203002210033023022301 |
5 | 2432031323204234142 |
6 | 35455021013434241 |
7 | 2234315211633616 |
oct | 243024417131261 |
9 | 43602503334277 |
10 | 11204030149297 |
11 | 362a669a26a07 |
12 | 130b4bb03b981 |
13 | 6336c668c84b |
14 | 2aa3c69b850d |
15 | 14669885bc67 |
hex | a30a43cb2b1 |
11204030149297 has 2 divisors, whose sum is σ = 11204030149298. Its totient is φ = 11204030149296.
The previous prime is 11204030149267. The next prime is 11204030149303. The reversal of 11204030149297 is 79294103040211.
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., 11152500695296 + 51529454001 = 3339536^2 + 227001^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11204030149297 is a prime.
It is a super-2 number, since 2×112040301492972 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11204030149267) 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, 5602015074648 + 5602015074649.
It is an arithmetic number, because the mean of its divisors is an integer number (5602015074649).
Almost surely, 211204030149297 is an apocalyptic number.
It is an amenable number.
11204030149297 is a deficient number, since it is larger than the sum of its proper divisors (1).
11204030149297 is an equidigital number, since it uses as much as digits as its factorization.
11204030149297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108864, while the sum is 43.
The spelling of 11204030149297 in words is "eleven trillion, two hundred four billion, thirty million, one hundred forty-nine thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •