Search a number
-
+
1132513368013 is a prime number
BaseRepresentation
bin10000011110101111000…
…011101001011111001101
311000021012210200222212001
4100132233003221133031
5122023341410234023
62224134111512301
7144551510536636
oct20365703513715
94007183628761
101132513368013
113a73292a9675
121635a4528691
1382a45aa0381
143cb5764288d
151e6d50966ad
hex107af0e97cd

1132513368013 has 2 divisors, whose sum is σ = 1132513368014. Its totient is φ = 1132513368012.

The previous prime is 1132513367981. The next prime is 1132513368031. The reversal of 1132513368013 is 3108633152311.

Together with next prime (1132513368031) 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., 623749289284 + 508764078729 = 789778^2 + 713277^2 .

It is a cyclic number.

It is not a de Polignac number, because 1132513368013 - 25 = 1132513367981 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1132513368043) 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, 566256684006 + 566256684007.

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

Almost surely, 21132513368013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1132513368013 in words is "one trillion, one hundred thirty-two billion, five hundred thirteen million, three hundred sixty-eight thousand, thirteen".