Base | Representation |
---|---|
bin | 111010100101110… |
… | …1100101000101000 |
3 | 12002000101011221000 |
4 | 1311023230220220 |
5 | 13011244010210 |
6 | 523030115000 |
7 | 66501505260 |
oct | 16513545050 |
9 | 5060334830 |
10 | 1966000680 |
11 | 919835456 |
12 | 46a4aba60 |
13 | 254401c17 |
14 | 1491687a0 |
15 | b78e8ac0 |
hex | 752eca28 |
1966000680 has 256 divisors, whose sum is σ = 7884288000. Its totient is φ = 425689344.
The previous prime is 1966000679. The next prime is 1966000697. The reversal of 1966000680 is 860006691.
It is a Harshad number since it is a multiple of its sum of digits (36).
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, 136797 + ... + 150483.
It is an arithmetic number, because the mean of its divisors is an integer number (30798000).
Almost surely, 21966000680 is an apocalyptic number.
1966000680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1966000680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3942144000).
1966000680 is an abundant number, since it is smaller than the sum of its proper divisors (5918287320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1966000680 is a wasteful number, since it uses less digits than its factorization.
1966000680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13733 (or 13723 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The square root of 1966000680 is about 44339.6062228793. The cubic root of 1966000680 is about 1252.7407977632.
The spelling of 1966000680 in words is "one billion, nine hundred sixty-six million, six hundred eighty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •