Base | Representation |
---|---|
bin | 101010001001010… |
… | …000000001101101 |
3 | 1211021110202222012 |
4 | 222021100001231 |
5 | 2422002134023 |
6 | 154054531005 |
7 | 23343656531 |
oct | 5211200155 |
9 | 1737422865 |
10 | 707068013 |
11 | 333137733 |
12 | 178966a65 |
13 | b3645552 |
14 | 69c97bc1 |
15 | 4211b978 |
hex | 2a25006d |
707068013 has 2 divisors, whose sum is σ = 707068014. Its totient is φ = 707068012.
The previous prime is 707068009. The next prime is 707068031. The reversal of 707068013 is 310860707.
It is a happy number.
Together with next prime (707068031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 353552809 + 353515204 = 18803^2 + 18802^2 .
It is a cyclic number.
It is not a de Polignac number, because 707068013 - 22 = 707068009 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (707068003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 353534006 + 353534007.
It is an arithmetic number, because the mean of its divisors is an integer number (353534007).
Almost surely, 2707068013 is an apocalyptic number.
707068013 is the 18803-rd centered square number.
It is an amenable number.
707068013 is a deficient number, since it is larger than the sum of its proper divisors (1).
707068013 is an equidigital number, since it uses as much as digits as its factorization.
707068013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7056, while the sum is 32.
The square root of 707068013 is about 26590.7505159219. The cubic root of 707068013 is about 890.8824362247.
The spelling of 707068013 in words is "seven hundred seven million, sixty-eight thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •