Search a number
-
+
148275906801013 is a prime number
BaseRepresentation
bin100001101101101100101100…
…110000001110110101110101
3201110000001000212221122112101
4201231230230300032311311
5123413323024120113023
61243205002231222101
743142403124312225
oct4155545460166565
9643001025848471
10148275906801013
1143277505931782
1214768a45217931
1364974867350a4
142888840d32085
151221ee38601ad
hex86db2cc0ed75

148275906801013 has 2 divisors, whose sum is σ = 148275906801014. Its totient is φ = 148275906801012.

The previous prime is 148275906800999. The next prime is 148275906801019. The reversal of 148275906801013 is 310108609572841.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 99223154610724 + 49052752190289 = 9961082^2 + 7003767^2 .

It is a cyclic number.

It is not a de Polignac number, because 148275906801013 - 225 = 148275873246581 is a prime.

It is a congruent number.

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅148275906801013 = 296551813602026 is not.

Almost surely, 2148275906801013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2903040, while the sum is 55.

The spelling of 148275906801013 in words is "one hundred forty-eight trillion, two hundred seventy-five billion, nine hundred six million, eight hundred one thousand, thirteen".