Search a number
-
+
10110303253 is a prime number
BaseRepresentation
bin10010110101001111…
…01111110000010101
3222002121022121202001
421122213233300111
5131201214201003
64351122515301
7505354105531
oct113247576025
928077277661
1010110303253
114319003526
121b61b05b31
13c517ca87b
146bca76bc1
153e28ea61d
hex25a9efc15

10110303253 has 2 divisors, whose sum is σ = 10110303254. Its totient is φ = 10110303252.

The previous prime is 10110303251. The next prime is 10110303331. The reversal of 10110303253 is 35230301101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7282403569 + 2827899684 = 85337^2 + 53178^2 .

It is a cyclic number.

It is not a de Polignac number, because 10110303253 - 21 = 10110303251 is a prime.

Together with 10110303251, it forms a pair of twin primes.

It is a self number, because there is not a number n which added to its sum of digits gives 10110303253.

It is a congruent number.

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

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

Almost surely, 210110303253 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 270, while the sum is 19.

Adding to 10110303253 its reverse (35230301101), we get a palindrome (45340604354).

The spelling of 10110303253 in words is "ten billion, one hundred ten million, three hundred three thousand, two hundred fifty-three".