Base | Representation |
---|---|
bin | 101010001001001… |
… | …111110001100101 |
3 | 1211021110201112222 |
4 | 222021033301211 |
5 | 2422002120411 |
6 | 154054522125 |
7 | 23343653525 |
oct | 5211176145 |
9 | 1737421488 |
10 | 707066981 |
11 | 333136985 |
12 | 178966345 |
13 | b3644c3a |
14 | 69c97685 |
15 | 4211b4db |
hex | 2a24fc65 |
707066981 has 2 divisors, whose sum is σ = 707066982. Its totient is φ = 707066980.
The previous prime is 707066953. The next prime is 707066999. The reversal of 707066981 is 189660707.
707066981 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., 410710756 + 296356225 = 20266^2 + 17215^2 .
It is an emirp because it is prime and its reverse (189660707) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 707066981 - 226 = 639958117 is a prime.
It is a super-2 number, since 2×7070669812 = 999887431240908722, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (707066681) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 353533490 + 353533491.
It is an arithmetic number, because the mean of its divisors is an integer number (353533491).
Almost surely, 2707066981 is an apocalyptic number.
It is an amenable number.
707066981 is a deficient number, since it is larger than the sum of its proper divisors (1).
707066981 is an equidigital number, since it uses as much as digits as its factorization.
707066981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 127008, while the sum is 44.
The square root of 707066981 is about 26590.7311106709. The cubic root of 707066981 is about 890.8820027958.
The spelling of 707066981 in words is "seven hundred seven million, sixty-six thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.937 sec. • engine limits •