Search a number
-
+
10301111021 is a prime number
BaseRepresentation
bin10011001011111111…
…00111101011101101
3222120220100122210102
421211333213223231
5132044041023041
64422100320445
7513161666435
oct114577475355
928526318712
1010301111021
1144067881a3
121bb59a3125
13c821b6b86
146da1452c5
1540453b09b
hex265fe7aed

10301111021 has 2 divisors, whose sum is σ = 10301111022. Its totient is φ = 10301111020.

The previous prime is 10301110999. The next prime is 10301111027. The reversal of 10301111021 is 12011110301.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9103258921 + 1197852100 = 95411^2 + 34610^2 .

It is a cyclic number.

It is not a de Polignac number, because 10301111021 - 226 = 10234002157 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 210301111021 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 11.

Adding to 10301111021 its reverse (12011110301), we get a palindrome (22312221322).

The spelling of 10301111021 in words is "ten billion, three hundred one million, one hundred eleven thousand, twenty-one".