Search a number
-
+
1013192597 is a prime number
BaseRepresentation
bin111100011001000…
…001011110010101
32121121111111221202
4330121001132111
54033334130342
6244312122245
734051665164
oct7431013625
92547444852
101013192597
1147aa1465a
12243396385
13131ba8c61
14987c33db
155de3a332
hex3c641795

1013192597 has 2 divisors, whose sum is σ = 1013192598. Its totient is φ = 1013192596.

The previous prime is 1013192567. The next prime is 1013192599. The reversal of 1013192597 is 7952913101.

1013192597 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 510805201 + 502387396 = 22601^2 + 22414^2 .

It is a cyclic number.

It is not a de Polignac number, because 1013192597 - 228 = 744757141 is a prime.

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

It is a Chen prime.

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

It is a congruent number.

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

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

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

Almost surely, 21013192597 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 17010, while the sum is 38.

The square root of 1013192597 is about 31830.6864047887. The cubic root of 1013192597 is about 1004.3783345427.

The spelling of 1013192597 in words is "one billion, thirteen million, one hundred ninety-two thousand, five hundred ninety-seven".