Search a number
-
+
103113310931 is a prime number
BaseRepresentation
bin110000000001000001…
…0000100001011010011
3100212011010212220221222
41200002002010023103
53142134001422211
6115211500035255
710310146452521
oct1400202041323
9325133786858
10103113310931
113a803859744
1217b98532b2b
139953818367
144dc2721311
152a377121db
hex18020842d3

103113310931 has 2 divisors, whose sum is σ = 103113310932. Its totient is φ = 103113310930.

The previous prime is 103113310891. The next prime is 103113310933. The reversal of 103113310931 is 139013311301.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 103113310931 - 210 = 103113309907 is a prime.

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

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

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 103113310931.

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

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

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

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

Almost surely, 2103113310931 is an apocalyptic number.

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

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

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

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

The spelling of 103113310931 in words is "one hundred three billion, one hundred thirteen million, three hundred ten thousand, nine hundred thirty-one".