Search a number
-
+
300101313133 is a prime number
BaseRepresentation
bin1000101110111110110…
…11101010001001101101
31001200121120120021020101
410113133123222021231
514404101414010013
6345510432351101
730452535034036
oct4273733521155
91050546507211
10300101313133
111062aa405366
124a1b33a5491
13223b7b11ccb
141074c795a8d
157c165228dd
hex45df6ea26d

300101313133 has 2 divisors, whose sum is σ = 300101313134. Its totient is φ = 300101313132.

The previous prime is 300101313103. The next prime is 300101313203. The reversal of 300101313133 is 331313101003.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 295177063204 + 4924249929 = 543302^2 + 70173^2 .

It is a cyclic number.

It is not a de Polignac number, because 300101313133 - 25 = 300101313101 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2300101313133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 243, while the sum is 19.

Adding to 300101313133 its reverse (331313101003), we get a palindrome (631414414136).

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