Search a number
-
+
1030102210013 is a prime number
BaseRepresentation
bin11101111110101101110…
…00000101010111011101
310122110212121001010122012
432333112320011113131
5113334122131210023
62105120013201005
7134264615213162
oct16772670052735
93573777033565
101030102210013
1136795592a908
12147783190165
13761a4899326
1437c0029a069
151bbde32e978
hexefd6e055dd

1030102210013 has 2 divisors, whose sum is σ = 1030102210014. Its totient is φ = 1030102210012.

The previous prime is 1030102209973. The next prime is 1030102210057. The reversal of 1030102210013 is 3100122010301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 550271690809 + 479830519204 = 741803^2 + 692698^2 .

It is a cyclic number.

It is not a de Polignac number, because 1030102210013 - 26 = 1030102209949 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 1030102210013.

It is a congruent number.

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

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

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

Almost surely, 21030102210013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 14.

Adding to 1030102210013 its reverse (3100122010301), we get a palindrome (4130224220314).

The spelling of 1030102210013 in words is "one trillion, thirty billion, one hundred two million, two hundred ten thousand, thirteen".