Search a number
-
+
10041110701 is a prime number
BaseRepresentation
bin10010101100111111…
…10011000010101101
3221220210010021101221
421112133303002231
5131031011020301
64340211503341
7503554014136
oct112637630255
927823107357
1010041110701
114292a440a6
121b428b7b51
13c4038272b
146b37c4c8d
153db7cdda1
hex2567f30ad

10041110701 has 2 divisors, whose sum is σ = 10041110702. Its totient is φ = 10041110700.

The previous prime is 10041110689. The next prime is 10041110719. The reversal of 10041110701 is 10701114001.

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., 9990002500 + 51108201 = 99950^2 + 7149^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 10041110701 - 217 = 10040979629 is a prime.

It is a super-2 number, since 2×100411107012 (a number of 21 digits) contains 22 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 210041110701 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 28, while the sum is 16.

Adding to 10041110701 its reverse (10701114001), we get a palindrome (20742224702).

The spelling of 10041110701 in words is "ten billion, forty-one million, one hundred ten thousand, seven hundred one".