Search a number
-
+
13646101031 is a prime number
BaseRepresentation
bin11001011010101111…
…01111101000100111
31022020000112202110022
430231113233220213
5210421400213111
610134031145355
7662106642053
oct145527575047
938200482408
1013646101031
115872960752
12278a07525b
1313961bc0c4
149364b2c63
1554d0292db
hex32d5efa27

13646101031 has 2 divisors, whose sum is σ = 13646101032. Its totient is φ = 13646101030.

The previous prime is 13646101013. The next prime is 13646101033. The reversal of 13646101031 is 13010164631.

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

It is a strong prime.

It is an emirp because it is prime and its reverse (13010164631) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 13646101031 - 210 = 13646100007 is a prime.

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

Together with 13646101033, 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 (13646101033) by changing a digit.

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

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

Almost surely, 213646101031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1296, while the sum is 26.

Adding to 13646101031 its reverse (13010164631), we get a palindrome (26656265662).

The spelling of 13646101031 in words is "thirteen billion, six hundred forty-six million, one hundred one thousand, thirty-one".