Base | Representation |
---|---|
bin | 10100101010010010000… |
… | …10110010111101110001 |
3 | 2111212100210211012222011 |
4 | 22111021002302331301 |
5 | 43112331114324044 |
6 | 1302042111042521 |
7 | 102200601364516 |
oct | 12251102627561 |
9 | 2455323735864 |
10 | 709895073649 |
11 | 254079297a13 |
12 | b56ba510441 |
13 | 51c344aa4c8 |
14 | 2650555330d |
15 | 136ecb3b134 |
hex | a5490b2f71 |
709895073649 has 2 divisors, whose sum is σ = 709895073650. Its totient is φ = 709895073648.
The previous prime is 709895073611. The next prime is 709895073683. The reversal of 709895073649 is 946370598907.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 707900111424 + 1994962225 = 841368^2 + 44665^2 .
It is an emirp because it is prime and its reverse (946370598907) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 709895073649 - 221 = 709892976497 is a prime.
It is a super-2 number, since 2×7098950736492 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (709895073049) 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, 354947536824 + 354947536825.
It is an arithmetic number, because the mean of its divisors is an integer number (354947536825).
Almost surely, 2709895073649 is an apocalyptic number.
It is an amenable number.
709895073649 is a deficient number, since it is larger than the sum of its proper divisors (1).
709895073649 is an equidigital number, since it uses as much as digits as its factorization.
709895073649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 102876480, while the sum is 67.
The spelling of 709895073649 in words is "seven hundred nine billion, eight hundred ninety-five million, seventy-three thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •