Search a number
-
+
1361060626033 is a prime number
BaseRepresentation
bin10011110011100101100…
…010001111111001110001
311211010010122200122101001
4103303211202033321301
5134244423010013113
62521132420442001
7200222231302303
oct23634542177161
94733118618331
101361060626033
1148524a271299
1219b948549301
139b4694ca6a4
1449c38c4b973
152560e8327dd
hex13ce588fe71

1361060626033 has 2 divisors, whose sum is σ = 1361060626034. Its totient is φ = 1361060626032.

The previous prime is 1361060626021. The next prime is 1361060626157. The reversal of 1361060626033 is 3306260601631.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 716110290289 + 644950335744 = 846233^2 + 803088^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1361060626033 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1361060625983 and 1361060626001.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 21361060626033 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 69984, while the sum is 37.

The spelling of 1361060626033 in words is "one trillion, three hundred sixty-one billion, sixty million, six hundred twenty-six thousand, thirty-three".