Search a number
-
+
712013513 is a prime number
BaseRepresentation
bin101010011100000…
…111011011001001
31211121210000220212
4222130013123021
52424233413023
6154352530505
723434005101
oct5234073311
91747700825
10712013513
11335a05322
1217a550a35
13b4687593
146a7c4201
1542796e78
hex2a7076c9

712013513 has 2 divisors, whose sum is σ = 712013514. Its totient is φ = 712013512.

The previous prime is 712013473. The next prime is 712013531. The reversal of 712013513 is 315310217.

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

Together with next prime (712013531) 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., 505890064 + 206123449 = 22492^2 + 14357^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 712013513 - 210 = 712012489 is a prime.

It is a Chen prime.

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

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

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

Almost surely, 2712013513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 630, while the sum is 23.

The square root of 712013513 is about 26683.5813375941. The cubic root of 712013513 is about 892.9546681542.

The spelling of 712013513 in words is "seven hundred twelve million, thirteen thousand, five hundred thirteen".