Base | Representation |
---|---|
bin | 101101110100010… |
… | …110001101000101 |
3 | 1222120102212021002 |
4 | 231310112031011 |
5 | 3033241302112 |
6 | 204135503045 |
7 | 25022550404 |
oct | 5564261505 |
9 | 1876385232 |
10 | 768697157 |
11 | 364a00608 |
12 | 195527a85 |
13 | c3342bb7 |
14 | 7413b63b |
15 | 477421c2 |
hex | 2dd16345 |
768697157 has 4 divisors (see below), whose sum is σ = 769599180. Its totient is φ = 767795136.
The previous prime is 768697133. The next prime is 768697187. The reversal of 768697157 is 751796867.
768697157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 266309761 + 502387396 = 16319^2 + 22414^2 .
It is a cyclic number.
It is not a de Polignac number, because 768697157 - 216 = 768631621 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (768697187) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 449732 + ... + 451437.
It is an arithmetic number, because the mean of its divisors is an integer number (192399795).
Almost surely, 2768697157 is an apocalyptic number.
It is an amenable number.
768697157 is a deficient number, since it is larger than the sum of its proper divisors (902023).
768697157 is an equidigital number, since it uses as much as digits as its factorization.
768697157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 902022.
The product of its digits is 4445280, while the sum is 56.
The square root of 768697157 is about 27725.3883110769. The cubic root of 768697157 is about 916.0484093871.
The spelling of 768697157 in words is "seven hundred sixty-eight million, six hundred ninety-seven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •