Search a number
-
+
10250113 is a prime number
BaseRepresentation
bin100111000110…
…011110000001
3201021202111211
4213012132001
510111000423
61003410121
7153060466
oct47063601
921252454
1010250113
115871075
123523941
13217b673
14150b66d
15d7710d
hex9c6781

10250113 has 2 divisors, whose sum is σ = 10250114. Its totient is φ = 10250112.

The previous prime is 10250083. The next prime is 10250131. The reversal of 10250113 is 31105201.

Together with next prime (10250131) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6801664 + 3448449 = 2608^2 + 1857^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 10250113 - 29 = 10249601 is a prime.

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

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

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

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

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

Almost surely, 210250113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 30, while the sum is 13.

The square root of 10250113 is about 3201.5797663029. The cubic root of 10250113 is about 217.2248725398.

Adding to 10250113 its reverse (31105201), we get a palindrome (41355314).

The spelling of 10250113 in words is "ten million, two hundred fifty thousand, one hundred thirteen".