Search a number
-
+
10489430053 is a prime number
BaseRepresentation
bin10011100010011100…
…00000000000100101
31000002000201020221101
421301032000000211
5132440243230203
64452504520101
7520636453504
oct116116000045
930060636841
1010489430053
1144a3012063
122048a80031
13cb221145b
1471716683b
15415d3941d
hex271380025

10489430053 has 2 divisors, whose sum is σ = 10489430054. Its totient is φ = 10489430052.

The previous prime is 10489429987. The next prime is 10489430059. The reversal of 10489430053 is 35003498401.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10412569764 + 76860289 = 102042^2 + 8767^2 .

It is a cyclic number.

It is not a de Polignac number, because 10489430053 - 213 = 10489421861 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 210489430053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 51840, while the sum is 37.

The spelling of 10489430053 in words is "ten billion, four hundred eighty-nine million, four hundred thirty thousand, fifty-three".