Search a number
-
+
10361420021 is a prime number
BaseRepresentation
bin10011010011001011…
…01011100011110101
3222202002211200012002
421221211223203311
5132210010420041
64432053105045
7514523421431
oct115145534365
928662750162
1010361420021
11443782a247
122012028185
13c91841684
147041639c1
154099a059b
hex26996b8f5

10361420021 has 2 divisors, whose sum is σ = 10361420022. Its totient is φ = 10361420020.

The previous prime is 10361419969. The next prime is 10361420039. The reversal of 10361420021 is 12002416301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10360389796 + 1030225 = 101786^2 + 1015^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10361420021 is a prime.

It is a super-3 number, since 3×103614200213 (a number of 31 digits) contains 333 as substring.

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

It is a congruent number.

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

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

Almost surely, 210361420021 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 288, while the sum is 20.

Adding to 10361420021 its reverse (12002416301), we get a palindrome (22363836322).

The spelling of 10361420021 in words is "ten billion, three hundred sixty-one million, four hundred twenty thousand, twenty-one".