Search a number
-
+
1010001111013 is a prime number
BaseRepresentation
bin11101011001010001100…
…00011110011111100101
310120112222201021111122001
432230220300132133211
5113021440241023023
62051553233005301
7132653524536046
oct16545060363745
93515881244561
101010001111013
1135a3803296a4
121438b33b3831
13743202848cb
1436c547b88cd
151b4147936ad
hexeb28c1e7e5

1010001111013 has 2 divisors, whose sum is σ = 1010001111014. Its totient is φ = 1010001111012.

The previous prime is 1010001111001. The next prime is 1010001111023. The reversal of 1010001111013 is 3101111000101.

It is an a-pointer prime, because the next prime (1010001111023) can be obtained adding 1010001111013 to its sum of digits (10).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 990170275329 + 19830835684 = 995073^2 + 140822^2 .

It is a cyclic number.

It is not a de Polignac number, because 1010001111013 - 29 = 1010001110501 is a prime.

It is a congruent number.

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

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

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

Almost surely, 21010001111013 is an apocalyptic number.

It is an amenable number.

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

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

1010001111013 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 1010001111013 its reverse (3101111000101), we get a palindrome (4111112111114).

The spelling of 1010001111013 in words is "one trillion, ten billion, one million, one hundred eleven thousand, thirteen".