Search a number
-
+
110020301290213 is a prime number
BaseRepresentation
bin11001000001000000011000…
…111110011111101011100101
3112102112211121222000011211121
4121001000120332133223211
5103410033034112241323
61025554343442533541
732113463425605556
oct3101003076375345
9472484558004747
10110020301290213
1132068390944a96
121040a8083672b1
134950b40209212
141d2502225432d
15cabd31b44a5d
hex641018f9fae5

110020301290213 has 2 divisors, whose sum is σ = 110020301290214. Its totient is φ = 110020301290212.

The previous prime is 110020301290129. The next prime is 110020301290279. The reversal of 110020301290213 is 312092103020011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 67035205375009 + 42985095915204 = 8187503^2 + 6556302^2 .

It is a cyclic number.

It is not a de Polignac number, because 110020301290213 - 241 = 107821278034661 is a prime.

It is a congruent number.

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

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

Almost surely, 2110020301290213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 25.

The spelling of 110020301290213 in words is "one hundred ten trillion, twenty billion, three hundred one million, two hundred ninety thousand, two hundred thirteen".