Base | Representation |
---|---|
bin | 10100110101101011101… |
… | …00100001000110101001 |
3 | 2112110011022120102022012 |
4 | 22122311310201012221 |
5 | 43212344320424223 |
6 | 1304533250405305 |
7 | 102505343126234 |
oct | 12326564410651 |
9 | 2473138512265 |
10 | 716015014313 |
11 | 256729899a15 |
12 | b6927b90835 |
13 | 5269b37c181 |
14 | 2692626441b |
15 | 1395a066c78 |
hex | a6b5d211a9 |
716015014313 has 2 divisors, whose sum is σ = 716015014314. Its totient is φ = 716015014312.
The previous prime is 716015014289. The next prime is 716015014331. The reversal of 716015014313 is 313410510617.
Together with next prime (716015014331) 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., 415751564944 + 300263449369 = 644788^2 + 547963^2 .
It is a cyclic number.
It is not a de Polignac number, because 716015014313 - 26 = 716015014249 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 716015014313.
It is not a weakly prime, because it can be changed into another prime (716015064313) 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, 358007507156 + 358007507157.
It is an arithmetic number, because the mean of its divisors is an integer number (358007507157).
Almost surely, 2716015014313 is an apocalyptic number.
It is an amenable number.
716015014313 is a deficient number, since it is larger than the sum of its proper divisors (1).
716015014313 is an equidigital number, since it uses as much as digits as its factorization.
716015014313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 32.
The spelling of 716015014313 in words is "seven hundred sixteen billion, fifteen million, fourteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •