Base | Representation |
---|---|
bin | 110010000101010… |
… | …0111111101011100 |
3 | 11100010011120211111 |
4 | 1210022213331130 |
5 | 11420202203331 |
6 | 434431031404 |
7 | 56434033330 |
oct | 14412477534 |
9 | 4303146744 |
10 | 1680506716 |
11 | 792669629 |
12 | 3aa96b564 |
13 | 20a212995 |
14 | 11d28d7c0 |
15 | 9c802db1 |
hex | 642a7f5c |
1680506716 has 12 divisors (see below), whose sum is σ = 3361013488. Its totient is φ = 720217152.
The previous prime is 1680506701. The next prime is 1680506717. The reversal of 1680506716 is 6176050861.
1680506716 is an admirable number.
It is a super-2 number, since 2×16805067162 = 5648205645042209312, which contains 22 as substring.
It is a hoax number, since the sum of its digits (40) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1680506717) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30009021 + ... + 30009076.
Almost surely, 21680506716 is an apocalyptic number.
It is an amenable number.
1680506716 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1680506716 is a wasteful number, since it uses less digits than its factorization.
1680506716 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60018108 (or 60018106 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 40.
The square root of 1680506716 is about 40993.9839000798. The cubic root of 1680506716 is about 1188.9038976001.
The spelling of 1680506716 in words is "one billion, six hundred eighty million, five hundred six thousand, seven hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •