Base | Representation |
---|---|
bin | 10100110001000000101… |
… | …01100100110000000001 |
3 | 2112012200112111001100001 |
4 | 22120200111210300001 |
5 | 43142230304110401 |
6 | 1303440341200001 |
7 | 102356241155554 |
oct | 12304025446001 |
9 | 2465615431301 |
10 | 713507097601 |
11 | 255662178a81 |
12 | b6348100001 |
13 | 5238b90a49c |
14 | 2676915269b |
15 | 1385ecc5601 |
hex | a620564c01 |
713507097601 has 2 divisors, whose sum is σ = 713507097602. Its totient is φ = 713507097600.
The previous prime is 713507097599. The next prime is 713507097647. The reversal of 713507097601 is 106790705317.
It is an a-pointer prime, because the next prime (713507097647) can be obtained adding 713507097601 to its sum of digits (46).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 606803608576 + 106703489025 = 778976^2 + 326655^2 .
It is a cyclic number.
It is not a de Polignac number, because 713507097601 - 21 = 713507097599 is a prime.
Together with 713507097599, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (713507097691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 356753548800 + 356753548801.
It is an arithmetic number, because the mean of its divisors is an integer number (356753548801).
Almost surely, 2713507097601 is an apocalyptic number.
It is an amenable number.
713507097601 is a deficient number, since it is larger than the sum of its proper divisors (1).
713507097601 is an equidigital number, since it uses as much as digits as its factorization.
713507097601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 277830, while the sum is 46.
The spelling of 713507097601 in words is "seven hundred thirteen billion, five hundred seven million, ninety-seven thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •