Search a number
-
+
1685141036213 is a prime number
BaseRepresentation
bin11000100001011010001…
…110111001110010110101
312222002122101011020211212
4120201122032321302311
5210102132101124323
63330050524411205
7232514236320305
oct30413216716265
95862571136755
101685141036213
1159a734202128
122327123a6b05
13c2ba619a5cb
145b7c015b605
152dc7b0b7b78
hex1885a3b9cb5

1685141036213 has 2 divisors, whose sum is σ = 1685141036214. Its totient is φ = 1685141036212.

The previous prime is 1685141036123. The next prime is 1685141036269. The reversal of 1685141036213 is 3126301415861.

It is a happy number.

Together with previous prime (1685141036123) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1636715952964 + 48425083249 = 1279342^2 + 220057^2 .

It is a cyclic number.

It is not a de Polignac number, because 1685141036213 - 212 = 1685141032117 is a prime.

It is a congruent number.

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

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

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

Almost surely, 21685141036213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 103680, while the sum is 41.

The spelling of 1685141036213 in words is "one trillion, six hundred eighty-five billion, one hundred forty-one million, thirty-six thousand, two hundred thirteen".