Search a number
-
+
100012132313 is a prime number
BaseRepresentation
bin101110100100100110…
…0000000011111011001
3100120011000110201122122
41131021030000133121
53114311101213223
6113540035031025
710140252045452
oct1351114003731
9316130421578
10100012132313
1139462272305
1217471a3b475
13957b199a22
144baa8dc129
1529053345c8
hex17493007d9

100012132313 has 2 divisors, whose sum is σ = 100012132314. Its totient is φ = 100012132312.

The previous prime is 100012132249. The next prime is 100012132357. The reversal of 100012132313 is 313231210001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 91840514704 + 8171617609 = 303052^2 + 90397^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 100012132313 - 26 = 100012132249 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 100012132291 and 100012132300.

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

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

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

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

Almost surely, 2100012132313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 108, while the sum is 17.

Adding to 100012132313 its reverse (313231210001), we get a palindrome (413243342314).

The spelling of 100012132313 in words is "one hundred billion, twelve million, one hundred thirty-two thousand, three hundred thirteen".