Base | Representation |
---|---|
bin | 101000100010100… |
… | …101100101111011 |
3 | 1202101211110222000 |
4 | 220202211211323 |
5 | 2343104434030 |
6 | 151254032043 |
7 | 22566140454 |
oct | 5042454573 |
9 | 1671743860 |
10 | 680155515 |
11 | 319a259a6 |
12 | 16b948623 |
13 | aabb19b0 |
14 | 6649012b |
15 | 3eaa2860 |
hex | 288a597b |
680155515 has 64 divisors (see below), whose sum is σ = 1306368000. Its totient is φ = 333770112.
The previous prime is 680155457. The next prime is 680155523. The reversal of 680155515 is 515551086.
680155515 is digitally balanced in base 2 and base 6, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 680155515 - 215 = 680122747 is a prime.
It is a super-3 number, since 3×6801555153 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 680155515.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1050922 + ... + 1051568.
It is an arithmetic number, because the mean of its divisors is an integer number (20412000).
Almost surely, 2680155515 is an apocalyptic number.
680155515 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
680155515 is a deficient number, since it is larger than the sum of its proper divisors (626212485).
680155515 is a wasteful number, since it uses less digits than its factorization.
680155515 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1273 (or 1267 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 36.
The square root of 680155515 is about 26079.7913143491. The cubic root of 680155515 is about 879.4329658872.
The spelling of 680155515 in words is "six hundred eighty million, one hundred fifty-five thousand, five hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •