Base | Representation |
---|---|
bin | 10011110011111110110… |
… | …01001111001100100001 |
3 | 2102002010002110111210221 |
4 | 21321333121033030201 |
5 | 42123124442430131 |
6 | 1240421214523041 |
7 | 100116265562644 |
oct | 11717731171441 |
9 | 2362102414727 |
10 | 680742155041 |
11 | 242779221753 |
12 | abb23206481 |
13 | 4c269771100 |
14 | 24d3b80ba5b |
15 | 12a93589411 |
hex | 9e7f64f321 |
680742155041 has 9 divisors (see below), whose sum is σ = 737146610931. Its totient is φ = 628367473032.
The previous prime is 680742155029. The next prime is 680742155081. The reversal of 680742155041 is 140551247086.
The square root of 680742155041 is 825071.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 100701502225 + 580040652816 = 317335^2 + 761604^2 .
It is not a de Polignac number, because 680742155041 - 29 = 680742154529 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (680742155011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 10694190 + ... + 10757656.
Almost surely, 2680742155041 is an apocalyptic number.
680742155041 is the 825071-st square number.
680742155041 is the 412536-th centered octagonal number.
It is an amenable number.
680742155041 is a deficient number, since it is larger than the sum of its proper divisors (56404455890).
680742155041 is an frugal number, since it uses more digits than its factorization.
680742155041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126960 (or 63480 counting only the distinct ones).
The product of its (nonzero) digits is 268800, while the sum is 43.
The spelling of 680742155041 in words is "six hundred eighty billion, seven hundred forty-two million, one hundred fifty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •