Search a number
-
+
1020130021121 is a prime number
BaseRepresentation
bin11101101100001000111…
…11001100111100000001
310121112010121121110011212
432312010133030330001
5113203211241133441
62100350302415505
7133462526052161
oct16660437147401
93545117543155
101020130021121
113636a8890792
1214585b591595
1375275898743
1437535ad65a1
151b808b16eeb
hexed847ccf01

1020130021121 has 2 divisors, whose sum is σ = 1020130021122. Its totient is φ = 1020130021120.

The previous prime is 1020130021103. The next prime is 1020130021153. The reversal of 1020130021121 is 1211200310201.

1020130021121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 592007136400 + 428122884721 = 769420^2 + 654311^2 .

It is a cyclic number.

It is not a de Polignac number, because 1020130021121 - 214 = 1020130004737 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1020130021096 and 1020130021105.

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

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

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

Almost surely, 21020130021121 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1020130021121 its reverse (1211200310201), we get a palindrome (2231330331322).

The spelling of 1020130021121 in words is "one trillion, twenty billion, one hundred thirty million, twenty-one thousand, one hundred twenty-one".