Base | Representation |
---|---|
bin | 1010111011001000110101… |
… | …1110010110001011110101 |
3 | 1120112020202100122100000002 |
4 | 2232302031132112023311 |
5 | 3033242214114233021 |
6 | 41313454002401045 |
7 | 2346526210224413 |
oct | 256621536261365 |
9 | 46466670570002 |
10 | 12011102102261 |
11 | 391097500a629 |
12 | 141b9b9960185 |
13 | 691846815872 |
14 | 2d74aa26a2b3 |
15 | 15c68292c50b |
hex | aec8d7962f5 |
12011102102261 has 2 divisors, whose sum is σ = 12011102102262. Its totient is φ = 12011102102260.
The previous prime is 12011102102179. The next prime is 12011102102287. The reversal of 12011102102261 is 16220120111021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9569086439236 + 2442015663025 = 3093394^2 + 1562695^2 .
It is a cyclic number.
It is not a de Polignac number, because 12011102102261 - 214 = 12011102085877 is a prime.
It is a super-2 number, since 2×120111021022612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12011102102161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6005551051130 + 6005551051131.
It is an arithmetic number, because the mean of its divisors is an integer number (6005551051131).
Almost surely, 212011102102261 is an apocalyptic number.
It is an amenable number.
12011102102261 is a deficient number, since it is larger than the sum of its proper divisors (1).
12011102102261 is an equidigital number, since it uses as much as digits as its factorization.
12011102102261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 12011102102261 its reverse (16220120111021), we get a palindrome (28231222213282).
The spelling of 12011102102261 in words is "twelve trillion, eleven billion, one hundred two million, one hundred two thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •