Base | Representation |
---|---|
bin | 101000100011111… |
… | …111110101100101 |
3 | 1202102112021000110 |
4 | 220203333311211 |
5 | 2343203301112 |
6 | 151310003233 |
7 | 22602240234 |
oct | 5043776545 |
9 | 1672467013 |
10 | 680525157 |
11 | 31a158694 |
12 | 16baa6519 |
13 | aacb1010 |
14 | 66548b1b |
15 | 3eb2713c |
hex | 288ffd65 |
680525157 has 8 divisors (see below), whose sum is σ = 977164384. Its totient is φ = 418784688.
The previous prime is 680525149. The next prime is 680525189. The reversal of 680525157 is 751525086.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 680525157 - 23 = 680525149 is a prime.
It is a super-2 number, since 2×6805251572 = 926228978619749298, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 17449363 = 680525157 / (6 + 8 + 0 + 5 + 2 + 5 + 1 + 5 + 7).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (680527157) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8724643 + ... + 8724720.
It is an arithmetic number, because the mean of its divisors is an integer number (122145548).
Almost surely, 2680525157 is an apocalyptic number.
It is an amenable number.
680525157 is a deficient number, since it is larger than the sum of its proper divisors (296639227).
680525157 is a wasteful number, since it uses less digits than its factorization.
680525157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17449379.
The product of its (nonzero) digits is 84000, while the sum is 39.
The square root of 680525157 is about 26086.8771032487. The cubic root of 680525157 is about 879.5922512672.
The spelling of 680525157 in words is "six hundred eighty million, five hundred twenty-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •