Search a number
-
+
10421103013 is a prime number
BaseRepresentation
bin10011011010010010…
…10110100110100101
3222220021010212212021
421231021112212211
5132320300244023
64442024223141
7516146625346
oct115511264645
928807125767
1010421103013
114468493a32
12202a00aab1
13ca100a259
1470c05c0cd
1540ed3e35d
hex26d2569a5

10421103013 has 2 divisors, whose sum is σ = 10421103014. Its totient is φ = 10421103012.

The previous prime is 10421102999. The next prime is 10421103041. The reversal of 10421103013 is 31030112401.

10421103013 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., 10397269089 + 23833924 = 101967^2 + 4882^2 .

It is an emirp because it is prime and its reverse (31030112401) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10421103013 - 213 = 10421094821 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 210421103013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 72, while the sum is 16.

Adding to 10421103013 its reverse (31030112401), we get a palindrome (41451215414).

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