Base | Representation |
---|---|
bin | 1010001100001111011111… |
… | …0010110110100111100101 |
3 | 1110200020011211020010101012 |
4 | 2203003313302312213211 |
5 | 2432042211043324422 |
6 | 35455412052312005 |
7 | 2234365023362642 |
oct | 243036762664745 |
9 | 43606154203335 |
10 | 11205432011237 |
11 | 36302192775a2 |
12 | 130b830612605 |
13 | 63388ac40959 |
14 | 2aa4bac52dc9 |
15 | 14672b96d4e2 |
hex | a30f7cb69e5 |
11205432011237 has 2 divisors, whose sum is σ = 11205432011238. Its totient is φ = 11205432011236.
The previous prime is 11205432011227. The next prime is 11205432011239. The reversal of 11205432011237 is 73211023450211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10816955299396 + 388476711841 = 3288914^2 + 623279^2 .
It is a cyclic number.
It is not a de Polignac number, because 11205432011237 - 212 = 11205432007141 is a prime.
Together with 11205432011239, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11205432011239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5602716005618 + 5602716005619.
It is an arithmetic number, because the mean of its divisors is an integer number (5602716005619).
Almost surely, 211205432011237 is an apocalyptic number.
It is an amenable number.
11205432011237 is a deficient number, since it is larger than the sum of its proper divisors (1).
11205432011237 is an equidigital number, since it uses as much as digits as its factorization.
11205432011237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10080, while the sum is 32.
Adding to 11205432011237 its reverse (73211023450211), we get a palindrome (84416455461448).
The spelling of 11205432011237 in words is "eleven trillion, two hundred five billion, four hundred thirty-two million, eleven thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •