Search a number
-
+
12366504615161 is a prime number
BaseRepresentation
bin1011001111110100110100…
…0111010101110011111001
31121210020002222011121211102
42303331031013111303321
53110103100140141121
642145032131541145
72414310340566224
oct263751507256371
947706088147742
1012366504615161
113a38672508874
12147886545a7b5
136b9205754088
1430a78341a5bb
15166a33de590b
hexb3f4d1d5cf9

12366504615161 has 2 divisors, whose sum is σ = 12366504615162. Its totient is φ = 12366504615160.

The previous prime is 12366504615013. The next prime is 12366504615173. The reversal of 12366504615161 is 16151640566321.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9936238752400 + 2430265862761 = 3152180^2 + 1558931^2 .

It is a cyclic number.

It is not a de Polignac number, because 12366504615161 - 230 = 12365430873337 is a prime.

It is a super-2 number, since 2×123665046151612 (a number of 27 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (12366504615181) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6183252307580 + 6183252307581.

It is an arithmetic number, because the mean of its divisors is an integer number (6183252307581).

Almost surely, 212366504615161 is an apocalyptic number.

It is an amenable number.

12366504615161 is a deficient number, since it is larger than the sum of its proper divisors (1).

12366504615161 is an equidigital number, since it uses as much as digits as its factorization.

12366504615161 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 777600, while the sum is 47.

The spelling of 12366504615161 in words is "twelve trillion, three hundred sixty-six billion, five hundred four million, six hundred fifteen thousand, one hundred sixty-one".