Search a number
-
+
10249489597 is a prime number
BaseRepresentation
bin10011000101110101…
…01100110010111101
3222110022020000111211
421202322230302331
5131442332131342
64413014044421
7511664136604
oct114272546275
928408200454
1010249489597
11438a62a266
121ba0649711
13c745b1759
146d3348a3b
153eec40c17
hex262eaccbd

10249489597 has 2 divisors, whose sum is σ = 10249489598. Its totient is φ = 10249489596.

The previous prime is 10249489571. The next prime is 10249489631. The reversal of 10249489597 is 79598494201.

10249489597 is digitally balanced in base 3, 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., 7040720281 + 3208769316 = 83909^2 + 56646^2 .

It is a cyclic number.

It is not a de Polignac number, because 10249489597 - 215 = 10249456829 is a prime.

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

It is a congruent number.

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

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

Almost surely, 210249489597 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6531840, while the sum is 58.

The spelling of 10249489597 in words is "ten billion, two hundred forty-nine million, four hundred eighty-nine thousand, five hundred ninety-seven".