Search a number
-
+
490312101213149 is a prime number
BaseRepresentation
bin110111101111011111010111…
…0100111110011001111011101
32101022001101020100211202000212
41233132332232213303033131
51003231233140402310044
64454450134132502205
7205163610643113515
oct15736765647631735
92338041210752025
10490312101213149
111322572157a7656
1246ba992a77a965
1318078304478627
1489113376b6845
153ba422272da9e
hex1bdefae9f33dd

490312101213149 has 2 divisors, whose sum is σ = 490312101213150. Its totient is φ = 490312101213148.

The previous prime is 490312101213091. The next prime is 490312101213199. The reversal of 490312101213149 is 941312101213094.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 479972294392900 + 10339806820249 = 21908270^2 + 3215557^2 .

It is a cyclic number.

It is not a de Polignac number, because 490312101213149 - 212 = 490312101209053 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 2490312101213149 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 46656, while the sum is 41.

The spelling of 490312101213149 in words is "four hundred ninety trillion, three hundred twelve billion, one hundred one million, two hundred thirteen thousand, one hundred forty-nine".