Search a number
-
+
1959919935013 is a prime number
BaseRepresentation
bin11100100001010100010…
…101001101111000100101
320221100220012010120221201
4130201110111031320211
5224102404000410023
64100212542042501
7261412433400445
oct34412425157045
96840805116851
101959919935013
11696219787837
12277a19279431
13112a86a2aca1
146ac09800125
1535eae47cbad
hex1c85454de25

1959919935013 has 2 divisors, whose sum is σ = 1959919935014. Its totient is φ = 1959919935012.

The previous prime is 1959919935011. The next prime is 1959919935023. The reversal of 1959919935013 is 3105399199591.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1881456642244 + 78463292769 = 1371662^2 + 280113^2 .

It is a cyclic number.

It is not a de Polignac number, because 1959919935013 - 21 = 1959919935011 is a prime.

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

Together with 1959919935011, it forms a pair of twin primes.

It is a congruent number.

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

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

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

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

Almost surely, 21959919935013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13286025, while the sum is 64.

The spelling of 1959919935013 in words is "one trillion, nine hundred fifty-nine billion, nine hundred nineteen million, nine hundred thirty-five thousand, thirteen".